./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d2234696348c57e259060be7fd705b6cb557422b7cc5a74e51b2a22fa3392bc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:15,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:15,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:15,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:15,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:15,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:15,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:15,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:15,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:15,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:15,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:15,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:15,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:15,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:15,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:15,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:15,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:15,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:15,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:15,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:15,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:15,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:15,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:15,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:15,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:15,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:15,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:15,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:15,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:15,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:15,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:15,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:15,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:15,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:15,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:15,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:15,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:15,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:15,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:15,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:15,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:15,806 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:51:15,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:15,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:15,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:15,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:15,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:15,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:15,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:15,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:15,837 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:15,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:15,838 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:15,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:15,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:15,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:15,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:15,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:15,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:15,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:15,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:15,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:15,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:15,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:15,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:15,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:15,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:15,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:15,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:15,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:15,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:15,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:15,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:15,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:15,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:15,844 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 -> 0d2234696348c57e259060be7fd705b6cb557422b7cc5a74e51b2a22fa3392bc [2022-02-20 18:51:16,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:16,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:16,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:16,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:16,083 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:16,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:51:16,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd729fff/25cb50b810784d239ac43b4a82fe6307/FLAG051bac19a [2022-02-20 18:51:16,549 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:16,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:51:16,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd729fff/25cb50b810784d239ac43b4a82fe6307/FLAG051bac19a [2022-02-20 18:51:16,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd729fff/25cb50b810784d239ac43b4a82fe6307 [2022-02-20 18:51:16,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:16,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:16,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:16,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:16,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:16,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:16" (1/1) ... [2022-02-20 18:51:16,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b2430e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:16, skipping insertion in model container [2022-02-20 18:51:16,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:16" (1/1) ... [2022-02-20 18:51:16,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:16,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:17,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5817,5830] [2022-02-20 18:51:17,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8470,8483] [2022-02-20 18:51:17,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11277,11290] [2022-02-20 18:51:17,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13832,13845] [2022-02-20 18:51:17,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16838,16851] [2022-02-20 18:51:17,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19408,19421] [2022-02-20 18:51:17,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22168,22181] [2022-02-20 18:51:17,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:17,348 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:17,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5817,5830] [2022-02-20 18:51:17,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[8470,8483] [2022-02-20 18:51:17,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[11277,11290] [2022-02-20 18:51:17,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[13832,13845] [2022-02-20 18:51:17,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16838,16851] [2022-02-20 18:51:17,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[19408,19421] [2022-02-20 18:51:17,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[22168,22181] [2022-02-20 18:51:17,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:17,520 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:17,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17 WrapperNode [2022-02-20 18:51:17,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:17,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:17,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:17,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:17,530 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:51:17" (1/1) ... [2022-02-20 18:51:17,552 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:51:17" (1/1) ... [2022-02-20 18:51:17,637 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1242 [2022-02-20 18:51:17,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:17,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:17,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:17,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:17,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:17,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:17,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:17,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:17,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (1/1) ... [2022-02-20 18:51:17,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:17,752 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:51:17,772 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:51:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:17,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:17,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:17,928 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:17,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:18,879 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:18,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:18,891 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:18,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:18 BoogieIcfgContainer [2022-02-20 18:51:18,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:18,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:18,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:18,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:18,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:16" (1/3) ... [2022-02-20 18:51:18,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448fe7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:18, skipping insertion in model container [2022-02-20 18:51:18,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:17" (2/3) ... [2022-02-20 18:51:18,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448fe7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:18, skipping insertion in model container [2022-02-20 18:51:18,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:18" (3/3) ... [2022-02-20 18:51:18,911 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:51:18,917 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:18,917 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:51:18,974 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:18,980 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:51:18,980 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:51:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:51:19,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:19,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:19,018 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -102713619, now seen corresponding path program 1 times [2022-02-20 18:51:19,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:19,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833749456] [2022-02-20 18:51:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:19,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:19,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:19,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:19,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:19,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:19,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:19,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:19,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {272#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:19,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {272#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:51:19,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {273#(<= (+ ~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; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:51:19,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~1#1; {270#false} is VALID [2022-02-20 18:51:19,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {270#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~1#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~1#1 % 256 else main_~node3____CPAchecker_TMP_0~1#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {270#false} is VALID [2022-02-20 18:51:19,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {270#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {270#false} is VALID [2022-02-20 18:51:19,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {270#false} assume !(~r1~0 % 256 >= 3); {270#false} is VALID [2022-02-20 18:51:19,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {270#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {270#false} is VALID [2022-02-20 18:51:19,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {270#false} assume ~r1~0 % 256 < 3;main_~check__tmp~6#1 := 1;~__return_371~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_371~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {270#false} is VALID [2022-02-20 18:51:19,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {270#false} assume !(0 == main_~assert__arg~6#1 % 256);havoc main_~node1__m1~4#1;main_~node1__m1~4#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {270#false} assume !(0 == ~mode1~0 % 256); {270#false} is VALID [2022-02-20 18:51:19,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {270#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {270#false} assume !(main_~node1__m1~4#1 != ~nomsg~0);~mode1~0 := 0; {270#false} is VALID [2022-02-20 18:51:19,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {270#false} havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {270#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~4#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {270#false} assume main_~node2__m2~4#1 != ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {270#false} assume !(main_~node2__m2~4#1 > ~id2~0); {270#false} is VALID [2022-02-20 18:51:19,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {270#false} assume main_~node2__m2~4#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {270#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:51:19,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {270#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {270#false} is VALID [2022-02-20 18:51:19,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {270#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {270#false} is VALID [2022-02-20 18:51:19,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {270#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {270#false} is VALID [2022-02-20 18:51:19,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {270#false} assume !(~r1~0 % 256 >= 3); {270#false} is VALID [2022-02-20 18:51:19,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {270#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~7#1 := 0;~__return_846~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_846~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; {270#false} is VALID [2022-02-20 18:51:19,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {270#false} assume 0 == main_~assert__arg~7#1 % 256; {270#false} is VALID [2022-02-20 18:51:19,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-02-20 18:51:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:19,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:19,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833749456] [2022-02-20 18:51:19,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833749456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:19,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:19,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:19,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995056404] [2022-02-20 18:51:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:19,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:19,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:19,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:19,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:19,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:19,526 INFO L87 Difference]: Start difference. First operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:20,411 INFO L93 Difference]: Finished difference Result 343 states and 586 transitions. [2022-02-20 18:51:20,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:20,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-02-20 18:51:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-02-20 18:51:20,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-02-20 18:51:20,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:20,973 INFO L225 Difference]: With dead ends: 343 [2022-02-20 18:51:20,973 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 18:51:20,976 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:51:20,979 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 928 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:20,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 249 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 18:51:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-02-20 18:51:21,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:21,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,072 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,072 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,080 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-02-20 18:51:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-02-20 18:51:21,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:21,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:21,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 18:51:21,083 INFO L87 Difference]: Start difference. First operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 18:51:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,089 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-02-20 18:51:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-02-20 18:51:21,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:21,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:21,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:21,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2022-02-20 18:51:21,099 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 47 [2022-02-20 18:51:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:21,099 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2022-02-20 18:51:21,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-02-20 18:51:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:51:21,101 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:21,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:21,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:21,101 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1933719334, now seen corresponding path program 1 times [2022-02-20 18:51:21,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:21,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558374015] [2022-02-20 18:51:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:21,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {1301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:21,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {1304#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:21,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {1304#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:51:21,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {1304#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {1305#(<= (+ ~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; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {1305#(<= (+ ~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; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:51:21,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~2#1; {1302#false} is VALID [2022-02-20 18:51:21,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {1302#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1302#false} is VALID [2022-02-20 18:51:21,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {1302#false} assume !(~r1~0 % 256 >= 3); {1302#false} is VALID [2022-02-20 18:51:21,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {1302#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1302#false} is VALID [2022-02-20 18:51:21,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {1302#false} assume ~r1~0 % 256 < 3;main_~check__tmp~2#1 := 1;~__return_399~0 := main_~check__tmp~2#1;main_~main__c1~0#1 := ~__return_399~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {1302#false} is VALID [2022-02-20 18:51:21,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {1302#false} assume !(0 == main_~assert__arg~2#1 % 256);havoc main_~node1__m1~2#1;main_~node1__m1~2#1 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {1302#false} assume !(0 == ~mode1~0 % 256); {1302#false} is VALID [2022-02-20 18:51:21,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {1302#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {1302#false} assume !(main_~node1__m1~2#1 != ~nomsg~0);~mode1~0 := 0; {1302#false} is VALID [2022-02-20 18:51:21,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {1302#false} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {1302#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {1302#false} assume main_~node2__m2~2#1 != ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {1302#false} assume !(main_~node2__m2~2#1 > ~id2~0); {1302#false} is VALID [2022-02-20 18:51:21,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {1302#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {1302#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {1302#false} assume main_~node3__m3~2#1 != ~nomsg~0; {1302#false} is VALID [2022-02-20 18:51:21,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {1302#false} assume !(main_~node3__m3~2#1 > ~id3~0); {1302#false} is VALID [2022-02-20 18:51:21,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {1302#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {1302#false} is VALID [2022-02-20 18:51:21,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {1302#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1032~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1032~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {1302#false} is VALID [2022-02-20 18:51:21,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#false} assume 0 == main_~assert__arg~3#1 % 256; {1302#false} is VALID [2022-02-20 18:51:21,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {1302#false} assume !false; {1302#false} is VALID [2022-02-20 18:51:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:21,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:21,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558374015] [2022-02-20 18:51:21,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558374015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:21,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:21,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:21,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725470637] [2022-02-20 18:51:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:21,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:21,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:21,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:21,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:21,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:21,284 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,812 INFO L93 Difference]: Finished difference Result 279 states and 353 transitions. [2022-02-20 18:51:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 353 transitions. [2022-02-20 18:51:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 353 transitions. [2022-02-20 18:51:21,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 353 transitions. [2022-02-20 18:51:22,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:22,117 INFO L225 Difference]: With dead ends: 279 [2022-02-20 18:51:22,117 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 18:51:22,118 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:51:22,119 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 592 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:22,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 139 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 18:51:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-02-20 18:51:22,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:22,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,229 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,230 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:22,234 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2022-02-20 18:51:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2022-02-20 18:51:22,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:22,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:22,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 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 177 states. [2022-02-20 18:51:22,236 INFO L87 Difference]: Start difference. First operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 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 177 states. [2022-02-20 18:51:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:22,241 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2022-02-20 18:51:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2022-02-20 18:51:22,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:22,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:22,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:22,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 219 transitions. [2022-02-20 18:51:22,253 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 219 transitions. Word has length 47 [2022-02-20 18:51:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:22,253 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 219 transitions. [2022-02-20 18:51:22,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2022-02-20 18:51:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:51:22,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:22,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:22,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:22,255 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 458596476, now seen corresponding path program 1 times [2022-02-20 18:51:22,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:22,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612450055] [2022-02-20 18:51:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:22,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {2213#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {2215#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:22,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2215#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:22,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {2215#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:22,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {2215#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2216#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:22,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {2216#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {2216#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:22,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:22,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {2214#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~1#1; {2214#false} is VALID [2022-02-20 18:51:22,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {2214#false} assume ~send2~0 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {2214#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~1#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~1#1 % 256 else main_~node2____CPAchecker_TMP_0~1#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {2214#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {2214#false} is VALID [2022-02-20 18:51:22,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {2214#false} assume ~send3~0 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {2214#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~2#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {2214#false} is VALID [2022-02-20 18:51:22,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {2214#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2214#false} is VALID [2022-02-20 18:51:22,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {2214#false} assume !(~r1~0 % 256 >= 3); {2214#false} is VALID [2022-02-20 18:51:22,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {2214#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2214#false} is VALID [2022-02-20 18:51:22,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {2214#false} assume ~r1~0 % 256 < 3;main_~check__tmp~8#1 := 1;~__return_357~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_357~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; {2214#false} is VALID [2022-02-20 18:51:22,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !(0 == main_~assert__arg~8#1 % 256);havoc main_~node1__m1~5#1;main_~node1__m1~5#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {2214#false} assume !(0 == ~mode1~0 % 256); {2214#false} is VALID [2022-02-20 18:51:22,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {2214#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {2214#false} assume main_~node1__m1~5#1 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {2214#false} assume !(main_~node1__m1~5#1 > ~id1~0); {2214#false} is VALID [2022-02-20 18:51:22,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {2214#false} assume main_~node1__m1~5#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~6#1;main_~node2__m2~6#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {2214#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~6#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {2214#false} assume !(main_~node2__m2~6#1 != ~nomsg~0);~mode2~0 := 0; {2214#false} is VALID [2022-02-20 18:51:22,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {2214#false} havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {2214#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {2214#false} assume main_~node3__m3~7#1 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:51:22,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {2214#false} assume !(main_~node3__m3~7#1 > ~id3~0); {2214#false} is VALID [2022-02-20 18:51:22,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {2214#false} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~9#1; {2214#false} is VALID [2022-02-20 18:51:22,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {2214#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_764~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_764~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {2214#false} is VALID [2022-02-20 18:51:22,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {2214#false} assume 0 == main_~assert__arg~9#1 % 256; {2214#false} is VALID [2022-02-20 18:51:22,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-02-20 18:51:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:22,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:22,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612450055] [2022-02-20 18:51:22,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612450055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:22,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:22,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:22,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404501081] [2022-02-20 18:51:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:22,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:22,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:22,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:22,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:22,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:22,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:22,420 INFO L87 Difference]: Start difference. First operand 177 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:22,869 INFO L93 Difference]: Finished difference Result 255 states and 323 transitions. [2022-02-20 18:51:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:51:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2022-02-20 18:51:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2022-02-20 18:51:22,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 323 transitions. [2022-02-20 18:51:23,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:23,161 INFO L225 Difference]: With dead ends: 255 [2022-02-20 18:51:23,161 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 18:51:23,162 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:51:23,163 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 542 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:23,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [542 Valid, 121 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 18:51:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-02-20 18:51:23,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:23,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,314 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,315 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,318 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2022-02-20 18:51:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2022-02-20 18:51:23,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 155 states. [2022-02-20 18:51:23,320 INFO L87 Difference]: Start difference. First operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 155 states. [2022-02-20 18:51:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,324 INFO L93 Difference]: Finished difference Result 155 states and 192 transitions. [2022-02-20 18:51:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2022-02-20 18:51:23,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:23,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2022-02-20 18:51:23,329 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 47 [2022-02-20 18:51:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:23,329 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2022-02-20 18:51:23,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2022-02-20 18:51:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:51:23,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:23,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:23,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:23,331 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1498085814, now seen corresponding path program 1 times [2022-02-20 18:51:23,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:23,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257410730] [2022-02-20 18:51:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:23,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {3031#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {3033#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:23,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {3033#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {3034#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {3035#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {3035#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {3035#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {3035#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {3036#(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; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {3036#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:23,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {3036#(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; {3037#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:23,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {3037#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3037#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:23,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {3037#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {3037#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:23,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {3037#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3038#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:23,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {3038#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3039#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:51:23,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {3039#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {3032#false} is VALID [2022-02-20 18:51:23,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {3032#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {3032#false} is VALID [2022-02-20 18:51:23,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {3032#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_939~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_939~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; {3032#false} is VALID [2022-02-20 18:51:23,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {3032#false} assume 0 == main_~assert__arg~5#1 % 256; {3032#false} is VALID [2022-02-20 18:51:23,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {3032#false} assume !false; {3032#false} is VALID [2022-02-20 18:51:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:23,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:23,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257410730] [2022-02-20 18:51:23,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257410730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:23,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:23,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:23,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899861193] [2022-02-20 18:51:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:23,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:51:23,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:23,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:23,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:23,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:23,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:23,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:23,586 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,941 INFO L93 Difference]: Finished difference Result 330 states and 433 transitions. [2022-02-20 18:51:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:25,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:51:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 433 transitions. [2022-02-20 18:51:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 433 transitions. [2022-02-20 18:51:25,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 433 transitions. [2022-02-20 18:51:26,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:26,363 INFO L225 Difference]: With dead ends: 330 [2022-02-20 18:51:26,364 INFO L226 Difference]: Without dead ends: 325 [2022-02-20 18:51:26,364 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:51:26,365 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1200 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:26,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1200 Valid, 613 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-02-20 18:51:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 155. [2022-02-20 18:51:26,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:26,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,545 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,545 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,555 INFO L93 Difference]: Finished difference Result 325 states and 428 transitions. [2022-02-20 18:51:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 428 transitions. [2022-02-20 18:51:26,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 325 states. [2022-02-20 18:51:26,557 INFO L87 Difference]: Start difference. First operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 325 states. [2022-02-20 18:51:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,566 INFO L93 Difference]: Finished difference Result 325 states and 428 transitions. [2022-02-20 18:51:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 428 transitions. [2022-02-20 18:51:26,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:26,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 191 transitions. [2022-02-20 18:51:26,574 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 191 transitions. Word has length 48 [2022-02-20 18:51:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:26,574 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 191 transitions. [2022-02-20 18:51:26,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 191 transitions. [2022-02-20 18:51:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:51:26,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:26,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:26,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:26,575 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 267052195, now seen corresponding path program 1 times [2022-02-20 18:51:26,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:26,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816217744] [2022-02-20 18:51:26,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:26,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {4329#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {4331#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:26,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {4331#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {4332#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {4332#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {4332#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {4332#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {4333#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {4333#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {4333#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {4333#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:26,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {4334#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4335#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:26,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {4335#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4335#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:26,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {4335#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {4335#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:26,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {4335#(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; {4335#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:26,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {4335#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4335#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:26,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {4335#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {4335#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:26,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {4335#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 3); {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,737 INFO L290 TraceCheckUtils]: 37: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4336#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:26,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {4336#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4337#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:26,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {4337#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {4330#false} is VALID [2022-02-20 18:51:26,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {4330#false} havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {4330#false} is VALID [2022-02-20 18:51:26,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {4330#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4330#false} is VALID [2022-02-20 18:51:26,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {4330#false} assume main_~node3__m3~7#1 != ~nomsg~0; {4330#false} is VALID [2022-02-20 18:51:26,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {4330#false} assume !(main_~node3__m3~7#1 > ~id3~0); {4330#false} is VALID [2022-02-20 18:51:26,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {4330#false} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~9#1; {4330#false} is VALID [2022-02-20 18:51:26,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {4330#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_764~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_764~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {4330#false} is VALID [2022-02-20 18:51:26,739 INFO L290 TraceCheckUtils]: 46: Hoare triple {4330#false} assume 0 == main_~assert__arg~9#1 % 256; {4330#false} is VALID [2022-02-20 18:51:26,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {4330#false} assume !false; {4330#false} is VALID [2022-02-20 18:51:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:26,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:26,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816217744] [2022-02-20 18:51:26,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816217744] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:26,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:26,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:26,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121518308] [2022-02-20 18:51:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:26,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:51:26,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:26,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:26,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:26,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:26,775 INFO L87 Difference]: Start difference. First operand 155 states and 191 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,060 INFO L93 Difference]: Finished difference Result 389 states and 517 transitions. [2022-02-20 18:51:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:29,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:51:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 517 transitions. [2022-02-20 18:51:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 517 transitions. [2022-02-20 18:51:29,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 517 transitions. [2022-02-20 18:51:29,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 517 edges. 517 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:29,461 INFO L225 Difference]: With dead ends: 389 [2022-02-20 18:51:29,461 INFO L226 Difference]: Without dead ends: 329 [2022-02-20 18:51:29,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:29,462 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 1037 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:29,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 823 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-02-20 18:51:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 155. [2022-02-20 18:51:29,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:29,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,668 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,668 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,679 INFO L93 Difference]: Finished difference Result 329 states and 433 transitions. [2022-02-20 18:51:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 433 transitions. [2022-02-20 18:51:29,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:29,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:29,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 329 states. [2022-02-20 18:51:29,689 INFO L87 Difference]: Start difference. First operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 329 states. [2022-02-20 18:51:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,697 INFO L93 Difference]: Finished difference Result 329 states and 433 transitions. [2022-02-20 18:51:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 433 transitions. [2022-02-20 18:51:29,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:29,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:29,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:29,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2022-02-20 18:51:29,702 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 48 [2022-02-20 18:51:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:29,702 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2022-02-20 18:51:29,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2022-02-20 18:51:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:51:29,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:29,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:29,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:29,704 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1788008380, now seen corresponding path program 1 times [2022-02-20 18:51:29,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:29,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181287561] [2022-02-20 18:51:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:29,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {5711#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {5713#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:29,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {5713#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:29,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {5714#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {5715#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:29,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {5715#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {5715#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:29,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {5715#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:29,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {5716#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5717#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:29,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {5717#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5717#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:29,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {5717#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 3); {5717#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:29,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {5717#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5717#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:29,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {5717#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {5717#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:29,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {5717#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {5717#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:29,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {5717#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {5717#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {5717#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5718#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {5718#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {5712#false} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {5712#false} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {5712#false} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {5712#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5712#false} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {5712#false} assume main_~node2__m2~2#1 != ~nomsg~0; {5712#false} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {5712#false} assume !(main_~node2__m2~2#1 > ~id2~0); {5712#false} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {5712#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {5712#false} is VALID [2022-02-20 18:51:29,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {5712#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5712#false} is VALID [2022-02-20 18:51:29,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {5712#false} assume main_~node3__m3~2#1 != ~nomsg~0; {5712#false} is VALID [2022-02-20 18:51:29,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {5712#false} assume !(main_~node3__m3~2#1 > ~id3~0); {5712#false} is VALID [2022-02-20 18:51:29,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {5712#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {5712#false} is VALID [2022-02-20 18:51:29,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {5712#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1032~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1032~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {5712#false} is VALID [2022-02-20 18:51:29,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {5712#false} assume 0 == main_~assert__arg~3#1 % 256; {5712#false} is VALID [2022-02-20 18:51:29,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {5712#false} assume !false; {5712#false} is VALID [2022-02-20 18:51:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:29,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:29,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181287561] [2022-02-20 18:51:29,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181287561] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:29,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:29,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:51:29,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121954745] [2022-02-20 18:51:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:51:29,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:29,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:29,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:51:29,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:51:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:29,918 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:31,317 INFO L93 Difference]: Finished difference Result 310 states and 390 transitions. [2022-02-20 18:51:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:51:31,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:51:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 390 transitions. [2022-02-20 18:51:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 390 transitions. [2022-02-20 18:51:31,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 390 transitions. [2022-02-20 18:51:31,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:31,620 INFO L225 Difference]: With dead ends: 310 [2022-02-20 18:51:31,620 INFO L226 Difference]: Without dead ends: 227 [2022-02-20 18:51:31,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:51:31,621 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 1171 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:31,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 302 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-02-20 18:51:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 155. [2022-02-20 18:51:31,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:31,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,819 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,820 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:31,824 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2022-02-20 18:51:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2022-02-20 18:51:31,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:31,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:31,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 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 227 states. [2022-02-20 18:51:31,826 INFO L87 Difference]: Start difference. First operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 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 227 states. [2022-02-20 18:51:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:31,830 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2022-02-20 18:51:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2022-02-20 18:51:31,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:31,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:31,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:31,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2022-02-20 18:51:31,834 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 48 [2022-02-20 18:51:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:31,834 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2022-02-20 18:51:31,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2022-02-20 18:51:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:31,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:31,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:31,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:51:31,836 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:31,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1932349207, now seen corresponding path program 1 times [2022-02-20 18:51:31,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:31,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131407010] [2022-02-20 18:51:31,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:32,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {6763#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {6763#true} is VALID [2022-02-20 18:51:32,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {6763#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {6765#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {6765#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {6765#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:32,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {6765#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {6766#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:32,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {6766#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {6766#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:32,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {6766#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {6767#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:32,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {6767#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {6767#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:32,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {6767#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {6768#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:32,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {6768#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {6768#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:32,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {6768#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {6769#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:32,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {6769#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {6769#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:32,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {6769#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {6770#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:32,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {6770#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {6770#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:32,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {6770#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {6771#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6772#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {6772#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6772#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {6772#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {6772#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:32,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {6772#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~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; {6773#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:32,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {6773#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6773#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:32,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {6773#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} assume ~send3~0 != ~nomsg~0; {6773#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:51:32,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {6773#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:32,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:32,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:32,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:32,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:32,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:32,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:32,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {6774#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6775#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {6775#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {6775#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {6775#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {6776#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {6776#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {6776#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {6776#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {6776#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {6776#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6777#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {6777#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {6777#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {6777#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {6778#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {6778#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {6779#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:32,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {6779#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6780#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:32,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {6780#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {6780#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:32,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {6780#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume !(main_~node3__m3~2#1 > ~id3~0); {6781#(<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:32,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {6781#(<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0)} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {6764#false} is VALID [2022-02-20 18:51:32,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {6764#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1032~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1032~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {6764#false} is VALID [2022-02-20 18:51:32,485 INFO L290 TraceCheckUtils]: 48: Hoare triple {6764#false} assume 0 == main_~assert__arg~3#1 % 256; {6764#false} is VALID [2022-02-20 18:51:32,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {6764#false} assume !false; {6764#false} is VALID [2022-02-20 18:51:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:32,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:32,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131407010] [2022-02-20 18:51:32,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131407010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:32,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:32,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:32,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834446133] [2022-02-20 18:51:32,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:32,487 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:32,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:32,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:32,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:32,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:32,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:32,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:32,531 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:38,263 INFO L93 Difference]: Finished difference Result 402 states and 505 transitions. [2022-02-20 18:51:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:51:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 505 transitions. [2022-02-20 18:51:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 505 transitions. [2022-02-20 18:51:38,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 505 transitions. [2022-02-20 18:51:38,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:38,749 INFO L225 Difference]: With dead ends: 402 [2022-02-20 18:51:38,750 INFO L226 Difference]: Without dead ends: 398 [2022-02-20 18:51:38,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 18:51:38,751 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 1459 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:38,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1459 Valid, 2348 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 18:51:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-02-20 18:51:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 165. [2022-02-20 18:51:39,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:39,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 398 states. Second operand has 165 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 164 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,283 INFO L74 IsIncluded]: Start isIncluded. First operand 398 states. Second operand has 165 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 164 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,283 INFO L87 Difference]: Start difference. First operand 398 states. Second operand has 165 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 164 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,293 INFO L93 Difference]: Finished difference Result 398 states and 501 transitions. [2022-02-20 18:51:39,293 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 501 transitions. [2022-02-20 18:51:39,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:39,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:39,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 164 states have internal predecessors, (204), 0 states have call successors, (0), 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 398 states. [2022-02-20 18:51:39,295 INFO L87 Difference]: Start difference. First operand has 165 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 164 states have internal predecessors, (204), 0 states have call successors, (0), 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 398 states. [2022-02-20 18:51:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,305 INFO L93 Difference]: Finished difference Result 398 states and 501 transitions. [2022-02-20 18:51:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 501 transitions. [2022-02-20 18:51:39,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:39,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:39,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:39,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 164 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2022-02-20 18:51:39,310 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 50 [2022-02-20 18:51:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:39,310 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2022-02-20 18:51:39,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2022-02-20 18:51:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:39,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:39,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] [2022-02-20 18:51:39,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:39,312 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1779763646, now seen corresponding path program 1 times [2022-02-20 18:51:39,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:39,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77962696] [2022-02-20 18:51:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:39,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {8324#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {8324#true} is VALID [2022-02-20 18:51:39,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {8324#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {8326#(and (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:39,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {8326#(and (<= ~send1~0 127) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {8326#(and (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:39,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {8326#(and (<= ~send1~0 127) (<= ~id3~0 127))} assume ~id1~0 >= 0; {8327#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:39,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {8327#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} assume 0 == ~st1~0; {8327#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:39,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {8327#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {8328#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {8328#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {8328#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {8329#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {8329#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {8329#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {8329#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {8330#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {8330#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {8330#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {8330#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {8331#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {8331#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {8331#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {8331#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:39,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {8332#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8333#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:39,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {8333#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8333#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:39,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {8333#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {8333#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:39,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {8333#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8334#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:39,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {8334#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8334#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:39,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {8334#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {8334#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:39,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {8334#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {8335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8336#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {8336#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {8336#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {8336#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {8337#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {8337#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8338#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:39,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {8338#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8339#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {8339#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {8339#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {8339#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {8340#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {8340#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {8340#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {8340#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {8340#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:39,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {8340#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8341#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:39,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {8341#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} assume main_~node3__m3~7#1 != ~nomsg~0; {8341#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:39,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {8341#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} assume !(main_~node3__m3~7#1 > ~id3~0); {8342#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:39,988 INFO L290 TraceCheckUtils]: 46: Hoare triple {8342#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~9#1; {8325#false} is VALID [2022-02-20 18:51:39,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {8325#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_764~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_764~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {8325#false} is VALID [2022-02-20 18:51:39,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {8325#false} assume 0 == main_~assert__arg~9#1 % 256; {8325#false} is VALID [2022-02-20 18:51:39,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {8325#false} assume !false; {8325#false} is VALID [2022-02-20 18:51:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:39,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:39,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77962696] [2022-02-20 18:51:39,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77962696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:39,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:39,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:39,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025358853] [2022-02-20 18:51:39,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:39,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:39,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:40,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:40,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:40,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:40,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:40,040 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,072 INFO L93 Difference]: Finished difference Result 438 states and 562 transitions. [2022-02-20 18:51:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 18:51:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 562 transitions. [2022-02-20 18:51:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 562 transitions. [2022-02-20 18:51:46,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 562 transitions. [2022-02-20 18:51:46,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:46,543 INFO L225 Difference]: With dead ends: 438 [2022-02-20 18:51:46,543 INFO L226 Difference]: Without dead ends: 391 [2022-02-20 18:51:46,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 18:51:46,544 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 1780 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:46,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1780 Valid, 2182 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 18:51:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-02-20 18:51:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 171. [2022-02-20 18:51:46,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:46,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 171 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 170 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,998 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 171 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 170 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,999 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 171 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 170 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:47,008 INFO L93 Difference]: Finished difference Result 391 states and 493 transitions. [2022-02-20 18:51:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 493 transitions. [2022-02-20 18:51:47,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:47,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:47,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 170 states have internal predecessors, (212), 0 states have call successors, (0), 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 391 states. [2022-02-20 18:51:47,010 INFO L87 Difference]: Start difference. First operand has 171 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 170 states have internal predecessors, (212), 0 states have call successors, (0), 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 391 states. [2022-02-20 18:51:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:47,019 INFO L93 Difference]: Finished difference Result 391 states and 493 transitions. [2022-02-20 18:51:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 493 transitions. [2022-02-20 18:51:47,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:47,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:47,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:47,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 170 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 212 transitions. [2022-02-20 18:51:47,024 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 212 transitions. Word has length 50 [2022-02-20 18:51:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:47,024 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 212 transitions. [2022-02-20 18:51:47,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 212 transitions. [2022-02-20 18:51:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:47,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:47,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:47,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:47,025 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1793833253, now seen corresponding path program 1 times [2022-02-20 18:51:47,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:47,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538556510] [2022-02-20 18:51:47,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:47,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {9926#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {9926#true} is VALID [2022-02-20 18:51:47,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {9926#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {9928#(and (<= ~send1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:47,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {9928#(and (<= ~send1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {9928#(and (<= ~send1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:47,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {9928#(and (<= ~send1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {9929#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:47,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {9929#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {9929#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:47,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {9929#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {9930#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:47,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {9930#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} assume 0 == ~mode1~0 % 256; {9930#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:47,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {9930#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} assume ~id2~0 >= 0; {9931#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {9931#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {9931#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {9931#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {9932#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {9932#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {9932#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {9932#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {9933#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {9933#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {9933#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {9933#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode3~0 % 256; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id1~0 != ~id2~0; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id1~0 != ~id3~0; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send1~0 != ~nomsg~0; {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:47,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {9934#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~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; {9935#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:47,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {9935#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9935#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:47,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {9935#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {9935#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:47,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {9935#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {9936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:47,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {9936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:47,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {9936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {9936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:47,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {9936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {9937#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:47,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {9938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {9938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:47,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {9938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {9939#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:47,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {9939#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {9940#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:47,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {9940#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9941#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:47,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {9941#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {9941#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:47,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {9941#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {9942#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:47,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {9942#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {9943#(<= ~p2_old~0 ~id3~0)} is VALID [2022-02-20 18:51:47,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {9943#(<= ~p2_old~0 ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9944#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} is VALID [2022-02-20 18:51:47,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {9944#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} assume main_~node3__m3~1#1 != ~nomsg~0; {9944#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} is VALID [2022-02-20 18:51:47,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {9944#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {9927#false} is VALID [2022-02-20 18:51:47,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {9927#false} ~mode3~0 := 0; {9927#false} is VALID [2022-02-20 18:51:47,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {9927#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {9927#false} is VALID [2022-02-20 18:51:47,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {9927#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_939~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_939~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; {9927#false} is VALID [2022-02-20 18:51:47,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {9927#false} assume 0 == main_~assert__arg~5#1 % 256; {9927#false} is VALID [2022-02-20 18:51:47,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {9927#false} assume !false; {9927#false} is VALID [2022-02-20 18:51:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:47,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:47,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538556510] [2022-02-20 18:51:47,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538556510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:47,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:47,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:47,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829681341] [2022-02-20 18:51:47,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:47,622 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:47,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:47,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:47,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:47,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:47,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:47,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:47,682 INFO L87 Difference]: Start difference. First operand 171 states and 212 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:55,252 INFO L93 Difference]: Finished difference Result 555 states and 742 transitions. [2022-02-20 18:51:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 18:51:55,253 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 742 transitions. [2022-02-20 18:51:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 742 transitions. [2022-02-20 18:51:55,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 742 transitions. [2022-02-20 18:51:55,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 742 edges. 742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:55,894 INFO L225 Difference]: With dead ends: 555 [2022-02-20 18:51:55,894 INFO L226 Difference]: Without dead ends: 549 [2022-02-20 18:51:55,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 18:51:55,895 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 2103 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:55,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2103 Valid, 2704 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 18:51:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-02-20 18:51:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 171. [2022-02-20 18:51:56,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:56,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 549 states. Second operand has 171 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,388 INFO L74 IsIncluded]: Start isIncluded. First operand 549 states. Second operand has 171 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,388 INFO L87 Difference]: Start difference. First operand 549 states. Second operand has 171 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,403 INFO L93 Difference]: Finished difference Result 549 states and 736 transitions. [2022-02-20 18:51:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 736 transitions. [2022-02-20 18:51:56,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 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 549 states. [2022-02-20 18:51:56,405 INFO L87 Difference]: Start difference. First operand has 171 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 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 549 states. [2022-02-20 18:51:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:56,420 INFO L93 Difference]: Finished difference Result 549 states and 736 transitions. [2022-02-20 18:51:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 736 transitions. [2022-02-20 18:51:56,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:56,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:56,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:56,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2022-02-20 18:51:56,425 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 50 [2022-02-20 18:51:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:56,425 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2022-02-20 18:51:56,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2022-02-20 18:51:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:56,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:56,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:56,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:56,427 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1827600366, now seen corresponding path program 1 times [2022-02-20 18:51:56,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:56,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324800015] [2022-02-20 18:51:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:56,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {12020#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {12020#true} is VALID [2022-02-20 18:51:56,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {12020#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {12022#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:56,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {12022#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {12022#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:56,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {12022#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {12023#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:56,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {12023#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {12023#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:56,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {12023#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {12024#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {12024#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode1~0 % 256; {12024#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {12024#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 >= 0; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st2~0; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send2~0 == ~id2~0; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode2~0 % 256; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id3~0 >= 0; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st3~0; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send3~0 == ~id3~0; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode3~0 % 256; {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id2~0; {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id3~0; {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send1~0 != ~nomsg~0; {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:56,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {12026#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {12027#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 % 256 >= 3); {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode1~0 % 256); {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {12028#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12029#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:56,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {12029#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12030#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:56,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {12030#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume main_~node2__m2~1#1 != ~nomsg~0; {12030#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:56,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {12030#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 > ~id2~0); {12031#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {12031#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {12021#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {12021#false} assume main_~node3__m3~1#1 != ~nomsg~0; {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {12021#false} assume !(main_~node3__m3~1#1 > ~id3~0); {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {12021#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {12021#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1142~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1142~0; {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {12021#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {12021#false} assume 0 == main_~assert__arg~1#1 % 256; {12021#false} is VALID [2022-02-20 18:51:56,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {12021#false} assume !false; {12021#false} is VALID [2022-02-20 18:51:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:56,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:56,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324800015] [2022-02-20 18:51:56,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324800015] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:56,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:56,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:56,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901867628] [2022-02-20 18:51:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:56,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:56,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:56,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:56,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:56,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:56,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:56,835 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:00,655 INFO L93 Difference]: Finished difference Result 378 states and 502 transitions. [2022-02-20 18:52:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:52:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:52:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 502 transitions. [2022-02-20 18:52:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 502 transitions. [2022-02-20 18:52:00,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 502 transitions. [2022-02-20 18:52:01,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:01,062 INFO L225 Difference]: With dead ends: 378 [2022-02-20 18:52:01,062 INFO L226 Difference]: Without dead ends: 324 [2022-02-20 18:52:01,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:52:01,062 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 1173 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:01,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1173 Valid, 1666 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:52:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-02-20 18:52:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 160. [2022-02-20 18:52:01,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:01,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 160 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 159 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:01,619 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 160 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 159 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:01,620 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 160 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 159 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:01,625 INFO L93 Difference]: Finished difference Result 324 states and 426 transitions. [2022-02-20 18:52:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 426 transitions. [2022-02-20 18:52:01,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:01,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:01,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 159 states have internal predecessors, (199), 0 states have call successors, (0), 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 324 states. [2022-02-20 18:52:01,631 INFO L87 Difference]: Start difference. First operand has 160 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 159 states have internal predecessors, (199), 0 states have call successors, (0), 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 324 states. [2022-02-20 18:52:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:01,637 INFO L93 Difference]: Finished difference Result 324 states and 426 transitions. [2022-02-20 18:52:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 426 transitions. [2022-02-20 18:52:01,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:01,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:01,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:01,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.2922077922077921) internal successors, (199), 159 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2022-02-20 18:52:01,640 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 50 [2022-02-20 18:52:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:01,641 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2022-02-20 18:52:01,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2022-02-20 18:52:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:52:01,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:01,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:01,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:01,643 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:52:01,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash -767196360, now seen corresponding path program 1 times [2022-02-20 18:52:01,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:01,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294771522] [2022-02-20 18:52:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:01,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:01,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {13385#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {13387#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:01,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {13387#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {13388#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {13389#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {13389#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {13389#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {13389#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {13390#(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; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {13390#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:01,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {13390#(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; {13391#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:01,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {13391#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13391#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:01,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {13391#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {13391#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:52:01,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {13391#(not (= ~nomsg~0 ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {13392#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:52:01,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {13392#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13393#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} is VALID [2022-02-20 18:52:01,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {13393#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {13386#false} is VALID [2022-02-20 18:52:01,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {13386#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {13386#false} is VALID [2022-02-20 18:52:01,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {13386#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13386#false} is VALID [2022-02-20 18:52:01,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {13386#false} assume !(~r1~0 % 256 >= 3); {13386#false} is VALID [2022-02-20 18:52:01,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {13386#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~7#1 := 0;~__return_846~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_846~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; {13386#false} is VALID [2022-02-20 18:52:01,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {13386#false} assume 0 == main_~assert__arg~7#1 % 256; {13386#false} is VALID [2022-02-20 18:52:01,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {13386#false} assume !false; {13386#false} is VALID [2022-02-20 18:52:01,773 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:01,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:01,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294771522] [2022-02-20 18:52:01,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294771522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:01,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:01,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:52:01,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977141582] [2022-02-20 18:52:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:52:01,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:01,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:01,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:01,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:52:01,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:01,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:52:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:52:01,814 INFO L87 Difference]: Start difference. First operand 160 states and 199 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,813 INFO L93 Difference]: Finished difference Result 239 states and 299 transitions. [2022-02-20 18:52:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:52:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:52:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2022-02-20 18:52:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2022-02-20 18:52:03,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 284 transitions. [2022-02-20 18:52:04,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:04,032 INFO L225 Difference]: With dead ends: 239 [2022-02-20 18:52:04,032 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 18:52:04,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:52:04,033 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 942 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:04,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 471 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:52:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 18:52:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 160. [2022-02-20 18:52:04,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:04,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 160 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,588 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 160 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,588 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 160 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,592 INFO L93 Difference]: Finished difference Result 232 states and 291 transitions. [2022-02-20 18:52:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 291 transitions. [2022-02-20 18:52:04,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:04,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:04,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 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 232 states. [2022-02-20 18:52:04,593 INFO L87 Difference]: Start difference. First operand has 160 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 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 232 states. [2022-02-20 18:52:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:04,596 INFO L93 Difference]: Finished difference Result 232 states and 291 transitions. [2022-02-20 18:52:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 291 transitions. [2022-02-20 18:52:04,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:04,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:04,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:04,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2022-02-20 18:52:04,600 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 51 [2022-02-20 18:52:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:04,600 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2022-02-20 18:52:04,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2022-02-20 18:52:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:52:04,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:04,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:04,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:04,601 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:52:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1195663953, now seen corresponding path program 1 times [2022-02-20 18:52:04,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:04,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550903206] [2022-02-20 18:52:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:04,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {14371#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {14373#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:52:04,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {14373#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {14374#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {14374#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {14374#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {14374#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {14375#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,781 INFO L290 TraceCheckUtils]: 4: Hoare triple {14375#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {14375#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {14375#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:52:04,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {14376#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:52:04,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:52:04,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~send2~0 != ~nomsg~0; {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:52:04,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~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; {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:52:04,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:52:04,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~send3~0 != ~nomsg~0; {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:52:04,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {14377#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:52:04,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:52:04,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(~r1~0 % 256 >= 3); {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:52:04,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:52:04,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:52:04,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:52:04,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == ~mode1~0 % 256); {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:52:04,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {14378#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14379#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:04,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {14379#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {14379#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:52:04,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {14379#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {14380#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:04,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {14380#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {14380#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:04,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {14380#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {14380#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:04,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {14380#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14381#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} is VALID [2022-02-20 18:52:04,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {14381#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} assume !(main_~node2__m2~2#1 != ~nomsg~0);~mode2~0 := 0; {14372#false} is VALID [2022-02-20 18:52:04,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {14372#false} havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {14372#false} is VALID [2022-02-20 18:52:04,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {14372#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14372#false} is VALID [2022-02-20 18:52:04,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {14372#false} assume main_~node3__m3~8#1 != ~nomsg~0; {14372#false} is VALID [2022-02-20 18:52:04,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {14372#false} assume !(main_~node3__m3~8#1 > ~id3~0); {14372#false} is VALID [2022-02-20 18:52:04,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {14372#false} assume main_~node3__m3~8#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {14372#false} is VALID [2022-02-20 18:52:04,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {14372#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14372#false} is VALID [2022-02-20 18:52:04,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {14372#false} assume !(~r1~0 % 256 >= 3); {14372#false} is VALID [2022-02-20 18:52:04,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {14372#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~11#1 := 0;~__return_671~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_671~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; {14372#false} is VALID [2022-02-20 18:52:04,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {14372#false} assume 0 == main_~assert__arg~11#1 % 256; {14372#false} is VALID [2022-02-20 18:52:04,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {14372#false} assume !false; {14372#false} is VALID [2022-02-20 18:52:04,801 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:04,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:04,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550903206] [2022-02-20 18:52:04,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550903206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:04,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:04,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:52:04,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573912810] [2022-02-20 18:52:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:52:04,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:04,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:04,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:04,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:52:04,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:52:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:52:04,847 INFO L87 Difference]: Start difference. First operand 160 states and 197 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:09,370 INFO L93 Difference]: Finished difference Result 449 states and 601 transitions. [2022-02-20 18:52:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:52:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:52:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 593 transitions. [2022-02-20 18:52:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 593 transitions. [2022-02-20 18:52:09,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 593 transitions. [2022-02-20 18:52:09,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:09,830 INFO L225 Difference]: With dead ends: 449 [2022-02-20 18:52:09,831 INFO L226 Difference]: Without dead ends: 388 [2022-02-20 18:52:09,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2022-02-20 18:52:09,832 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 1294 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:09,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 1069 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:52:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-02-20 18:52:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 160. [2022-02-20 18:52:10,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:10,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 160 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,387 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 160 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,387 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 160 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:10,393 INFO L93 Difference]: Finished difference Result 388 states and 515 transitions. [2022-02-20 18:52:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 515 transitions. [2022-02-20 18:52:10,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:10,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:10,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 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 388 states. [2022-02-20 18:52:10,393 INFO L87 Difference]: Start difference. First operand has 160 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 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 388 states. [2022-02-20 18:52:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:10,403 INFO L93 Difference]: Finished difference Result 388 states and 515 transitions. [2022-02-20 18:52:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 515 transitions. [2022-02-20 18:52:10,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:10,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:10,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:10,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 159 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2022-02-20 18:52:10,406 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 51 [2022-02-20 18:52:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:10,407 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2022-02-20 18:52:10,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-02-20 18:52:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:52:10,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:10,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:10,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:52:10,408 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:52:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash 72941877, now seen corresponding path program 1 times [2022-02-20 18:52:10,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:10,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500172374] [2022-02-20 18:52:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:10,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {15984#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_95~0 := 0;~__return_413~0 := 0;~__return_1142~0 := 0;~__return_399~0 := 0;~__return_1032~0 := 0;~__return_385~0 := 0;~__return_939~0 := 0;~__return_371~0 := 0;~__return_846~0 := 0;~__return_357~0 := 0;~__return_764~0 := 0;~__return_343~0 := 0;~__return_671~0 := 0;~__return_329~0 := 0;~__return_592~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1291~0 := 0; {15984#true} is VALID [2022-02-20 18:52:10,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {15984#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {15986#(<= ~id1~0 127)} is VALID [2022-02-20 18:52:10,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {15986#(<= ~id1~0 127)} assume 0 == ~r1~0 % 256; {15986#(<= ~id1~0 127)} is VALID [2022-02-20 18:52:10,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {15986#(<= ~id1~0 127)} assume ~id1~0 >= 0; {15987#(and (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:52:10,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {15987#(and (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~st1~0; {15987#(and (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:52:10,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {15987#(and (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~send1~0 == ~id1~0; {15988#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {15988#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {15988#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {15988#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {15989#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:10,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {15990#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {15991#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 % 256 >= 3); {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~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; {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode1~0 % 256); {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {15992#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 == ~id1~0); {15993#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {15993#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0; {15993#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {15993#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {15993#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:52:10,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {15993#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15994#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:52:10,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {15994#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {15994#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:52:10,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {15994#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {15995#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0)} is VALID [2022-02-20 18:52:10,714 INFO L290 TraceCheckUtils]: 43: Hoare triple {15995#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0)} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {15985#false} is VALID [2022-02-20 18:52:10,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {15985#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15985#false} is VALID [2022-02-20 18:52:10,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {15985#false} assume main_~node3__m3~2#1 != ~nomsg~0; {15985#false} is VALID [2022-02-20 18:52:10,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {15985#false} assume !(main_~node3__m3~2#1 > ~id3~0); {15985#false} is VALID [2022-02-20 18:52:10,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {15985#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {15985#false} is VALID [2022-02-20 18:52:10,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {15985#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1032~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1032~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {15985#false} is VALID [2022-02-20 18:52:10,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {15985#false} assume 0 == main_~assert__arg~3#1 % 256; {15985#false} is VALID [2022-02-20 18:52:10,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {15985#false} assume !false; {15985#false} is VALID [2022-02-20 18:52:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:52:10,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:10,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500172374] [2022-02-20 18:52:10,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500172374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:10,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:10,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:52:10,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319874953] [2022-02-20 18:52:10,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:10,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:52:10,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:10,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:52:10,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:10,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:52:10,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:52:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:52:10,762 INFO L87 Difference]: Start difference. First operand 160 states and 195 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)