./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+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:54,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:54,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:54,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:54,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:54,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:54,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:54,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:54,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:54,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:54,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:54,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:54,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:54,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:54,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:54,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:54,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:54,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:54,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:54,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:54,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:54,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:54,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:54,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:54,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:54,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:54,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:54,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:54,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:54,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:54,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:54,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:54,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:54,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:54,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:54,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:54,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:54,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:54,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:54,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:54,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:54,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:50:54,794 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:54,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:54,794 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:54,795 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:54,795 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:54,795 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:54,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:54,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:54,796 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:54,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:54,797 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:54,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:54,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:54,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:54,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:54,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:54,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:54,798 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:54,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:54,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:54,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:54,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:54,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:54,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:54,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:54,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:54,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:54,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:54,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:54,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:54,801 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:54,801 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:54,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:54,801 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 -> a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 [2022-02-20 18:50:54,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:54,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:54,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:54,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:54,976 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:54,977 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+lhb-reducer.c [2022-02-20 18:50:55,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96394fbc1/114a249434ba41caab66c92b0ecf1b6e/FLAG6437cfa96 [2022-02-20 18:50:55,448 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:55,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:50:55,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96394fbc1/114a249434ba41caab66c92b0ecf1b6e/FLAG6437cfa96 [2022-02-20 18:50:55,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96394fbc1/114a249434ba41caab66c92b0ecf1b6e [2022-02-20 18:50:55,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:55,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:55,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:55,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:55,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:55,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:55,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed64d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55, skipping insertion in model container [2022-02-20 18:50:55,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:55,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:55,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:55,686 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+lhb-reducer.c[7117,7130] [2022-02-20 18:50:55,697 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+lhb-reducer.c[9784,9797] [2022-02-20 18:50:55,712 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+lhb-reducer.c[10875,10888] [2022-02-20 18:50:55,726 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+lhb-reducer.c[11481,11494] [2022-02-20 18:50:55,736 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+lhb-reducer.c[12900,12913] [2022-02-20 18:50:55,745 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+lhb-reducer.c[13506,13519] [2022-02-20 18:50:55,749 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+lhb-reducer.c[14435,14448] [2022-02-20 18:50:55,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:55,794 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:55,851 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+lhb-reducer.c[7117,7130] [2022-02-20 18:50:55,859 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+lhb-reducer.c[9784,9797] [2022-02-20 18:50:55,862 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+lhb-reducer.c[10875,10888] [2022-02-20 18:50:55,864 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+lhb-reducer.c[11481,11494] [2022-02-20 18:50:55,868 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+lhb-reducer.c[12900,12913] [2022-02-20 18:50:55,870 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+lhb-reducer.c[13506,13519] [2022-02-20 18:50:55,872 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+lhb-reducer.c[14435,14448] [2022-02-20 18:50:55,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:55,906 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:55,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55 WrapperNode [2022-02-20 18:50:55,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:55,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:55,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:55,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:55,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:55,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:55,992 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 971 [2022-02-20 18:50:55,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:55,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:55,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:55,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:56,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:56,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:56,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:56,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:56,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (1/1) ... [2022-02-20 18:50:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:56,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:56,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:50:56,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:50:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:56,284 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:56,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:56,979 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:56,989 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:56,989 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:56,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:56 BoogieIcfgContainer [2022-02-20 18:50:56,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:56,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:56,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:56,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:56,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:55" (1/3) ... [2022-02-20 18:50:56,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e2a05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:56, skipping insertion in model container [2022-02-20 18:50:56,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:55" (2/3) ... [2022-02-20 18:50:56,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e2a05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:56, skipping insertion in model container [2022-02-20 18:50:56,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:56" (3/3) ... [2022-02-20 18:50:56,998 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:50:57,002 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:57,002 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:50:57,046 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:57,051 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:50:57,052 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:50:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 198 states have (on average 1.8232323232323233) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 18:50:57,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:57,083 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] [2022-02-20 18:50:57,084 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:57,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1899747950, now seen corresponding path program 1 times [2022-02-20 18:50:57,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:57,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124434581] [2022-02-20 18:50:57,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:57,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {209#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {211#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:57,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(<= (+ ~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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {211#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:57,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {211#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:57,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {211#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {212#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:57,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {212#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:57,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {213#(<= (+ ~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; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:57,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {210#false} is VALID [2022-02-20 18:50:57,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~2#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~2#1 % 256 else main_~node2____CPAchecker_TMP_0~2#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {210#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {210#false} is VALID [2022-02-20 18:50:57,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {210#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~16#1; {210#false} is VALID [2022-02-20 18:50:57,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {210#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {210#false} is VALID [2022-02-20 18:50:57,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {210#false} assume !(~r1~0 % 256 >= 3); {210#false} is VALID [2022-02-20 18:50:57,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {210#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {210#false} is VALID [2022-02-20 18:50:57,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {210#false} assume ~r1~0 % 256 < 3;main_~check__tmp~16#1 := 1;~__return_1462~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1462~0;havoc main_~__tmp_16~0#1;main_~__tmp_16~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~15#1;main_~assert__arg~15#1 := main_~__tmp_16~0#1; {210#false} is VALID [2022-02-20 18:50:57,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {210#false} assume !(0 == main_~assert__arg~15#1 % 256); {210#false} is VALID [2022-02-20 18:50:57,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {210#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {210#false} assume !(0 == ~mode1~0 % 256); {210#false} is VALID [2022-02-20 18:50:57,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {210#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {210#false} assume main_~node1__m1~1#1 != ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {210#false} assume !(main_~node1__m1~1#1 > ~id1~0); {210#false} is VALID [2022-02-20 18:50:57,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {210#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {210#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {210#false} assume main_~node2__m2~3#1 != ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {210#false} assume !(main_~node2__m2~3#1 > ~id2~0); {210#false} is VALID [2022-02-20 18:50:57,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {210#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {210#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {210#false} is VALID [2022-02-20 18:50:57,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {210#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {210#false} is VALID [2022-02-20 18:50:57,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {210#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {210#false} is VALID [2022-02-20 18:50:57,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {210#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2082~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2082~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; {210#false} is VALID [2022-02-20 18:50:57,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {210#false} assume 0 == main_~assert__arg~8#1 % 256; {210#false} is VALID [2022-02-20 18:50:57,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-02-20 18:50:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:57,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:57,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124434581] [2022-02-20 18:50:57,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124434581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:57,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:57,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:57,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952667605] [2022-02-20 18:50:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 18:50:57,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:57,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:57,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:57,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:57,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:57,437 INFO L87 Difference]: Start difference. First operand has 206 states, 198 states have (on average 1.8232323232323233) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 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.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,025 INFO L93 Difference]: Finished difference Result 338 states and 568 transitions. [2022-02-20 18:50:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:58,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 18:50:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2022-02-20 18:50:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2022-02-20 18:50:58,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 568 transitions. [2022-02-20 18:50:58,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:58,484 INFO L225 Difference]: With dead ends: 338 [2022-02-20 18:50:58,484 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 18:50:58,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:58,490 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 842 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:58,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [842 Valid, 223 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 18:50:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-02-20 18:50:58,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:58,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,575 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,576 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,582 INFO L93 Difference]: Finished difference Result 174 states and 216 transitions. [2022-02-20 18:50:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2022-02-20 18:50:58,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:58,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:58,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 174 states. [2022-02-20 18:50:58,585 INFO L87 Difference]: Start difference. First operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 174 states. [2022-02-20 18:50:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,590 INFO L93 Difference]: Finished difference Result 174 states and 216 transitions. [2022-02-20 18:50:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2022-02-20 18:50:58,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:58,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:58,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:58,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2022-02-20 18:50:58,598 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 46 [2022-02-20 18:50:58,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:58,598 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2022-02-20 18:50:58,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2022-02-20 18:50:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:58,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:58,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:58,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:58,600 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash -121525429, now seen corresponding path program 1 times [2022-02-20 18:50:58,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:58,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986641253] [2022-02-20 18:50:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:58,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {1180#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {1182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1182#(<= (+ ~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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {1182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {1182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {1182#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {1182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {1182#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:58,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1183#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:58,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {1183#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:58,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {1184#(<= (+ ~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; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {1184#(<= (+ ~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; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1184#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:58,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {1184#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {1181#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {1181#false} is VALID [2022-02-20 18:50:58,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {1181#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~2#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~12#1; {1181#false} is VALID [2022-02-20 18:50:58,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {1181#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1181#false} is VALID [2022-02-20 18:50:58,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {1181#false} assume !(~r1~0 % 256 >= 3); {1181#false} is VALID [2022-02-20 18:50:58,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {1181#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1181#false} is VALID [2022-02-20 18:50:58,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {1181#false} assume ~r1~0 % 256 < 3;main_~check__tmp~12#1 := 1;~__return_1956~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_1956~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; {1181#false} is VALID [2022-02-20 18:50:58,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {1181#false} assume !(0 == main_~assert__arg~11#1 % 256); {1181#false} is VALID [2022-02-20 18:50:58,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {1181#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {1181#false} assume !(0 == ~mode1~0 % 256); {1181#false} is VALID [2022-02-20 18:50:58,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {1181#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {1181#false} assume main_~node1__m1~1#1 != ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {1181#false} assume !(main_~node1__m1~1#1 > ~id1~0); {1181#false} is VALID [2022-02-20 18:50:58,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {1181#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {1181#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {1181#false} assume main_~node2__m2~3#1 != ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {1181#false} assume !(main_~node2__m2~3#1 > ~id2~0); {1181#false} is VALID [2022-02-20 18:50:58,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {1181#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {1181#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1181#false} is VALID [2022-02-20 18:50:58,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {1181#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {1181#false} is VALID [2022-02-20 18:50:58,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {1181#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {1181#false} is VALID [2022-02-20 18:50:58,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {1181#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2082~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2082~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; {1181#false} is VALID [2022-02-20 18:50:58,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {1181#false} assume 0 == main_~assert__arg~8#1 % 256; {1181#false} is VALID [2022-02-20 18:50:58,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {1181#false} assume !false; {1181#false} is VALID [2022-02-20 18:50:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:58,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:58,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986641253] [2022-02-20 18:50:58,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986641253] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:58,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:58,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:58,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503869658] [2022-02-20 18:50:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:58,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:50:58,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:58,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:58,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:58,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:58,760 INFO L87 Difference]: Start difference. First operand 174 states and 216 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:50:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,133 INFO L93 Difference]: Finished difference Result 297 states and 378 transitions. [2022-02-20 18:50:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:59,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 18:50:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:50:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 378 transitions. [2022-02-20 18:50:59,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 378 transitions. [2022-02-20 18:50:59,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 378 edges. 378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,383 INFO L225 Difference]: With dead ends: 297 [2022-02-20 18:50:59,383 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 18:50:59,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:59,385 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 552 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:59,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 132 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 18:50:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-02-20 18:50:59,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:59,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,477 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,477 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,480 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2022-02-20 18:50:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2022-02-20 18:50:59,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 18:50:59,481 INFO L87 Difference]: Start difference. First operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 161 states. [2022-02-20 18:50:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,484 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2022-02-20 18:50:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2022-02-20 18:50:59,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:59,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2022-02-20 18:50:59,488 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 47 [2022-02-20 18:50:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:59,488 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2022-02-20 18:50:59,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2022-02-20 18:50:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:59,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:59,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:59,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:59,490 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 414043727, now seen corresponding path program 1 times [2022-02-20 18:50:59,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:59,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947680276] [2022-02-20 18:50:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:59,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {2067#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {2069#(<= (+ ~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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {2069#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {2069#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {2070#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:59,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {2070#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {2070#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:59,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {2070#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {2071#(<= (+ ~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; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {2071#(<= (+ ~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; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#(<= (+ ~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; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2071#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:59,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {2071#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~10#1; {2068#false} is VALID [2022-02-20 18:50:59,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {2068#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2068#false} is VALID [2022-02-20 18:50:59,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {2068#false} assume !(~r1~0 % 256 >= 3); {2068#false} is VALID [2022-02-20 18:50:59,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {2068#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2068#false} is VALID [2022-02-20 18:50:59,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {2068#false} assume ~r1~0 % 256 < 3;main_~check__tmp~10#1 := 1;~__return_2129~0 := main_~check__tmp~10#1;main_~main__c1~0#1 := ~__return_2129~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; {2068#false} is VALID [2022-02-20 18:50:59,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {2068#false} assume !(0 == main_~assert__arg~9#1 % 256); {2068#false} is VALID [2022-02-20 18:50:59,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {2068#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {2068#false} assume !(0 == ~mode1~0 % 256); {2068#false} is VALID [2022-02-20 18:50:59,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {2068#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {2068#false} assume main_~node1__m1~1#1 != ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {2068#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2068#false} is VALID [2022-02-20 18:50:59,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {2068#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {2068#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {2068#false} assume main_~node2__m2~3#1 != ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {2068#false} assume !(main_~node2__m2~3#1 > ~id2~0); {2068#false} is VALID [2022-02-20 18:50:59,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {2068#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {2068#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2068#false} is VALID [2022-02-20 18:50:59,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {2068#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {2068#false} is VALID [2022-02-20 18:50:59,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {2068#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {2068#false} is VALID [2022-02-20 18:50:59,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {2068#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2082~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2082~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; {2068#false} is VALID [2022-02-20 18:50:59,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {2068#false} assume 0 == main_~assert__arg~8#1 % 256; {2068#false} is VALID [2022-02-20 18:50:59,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {2068#false} assume !false; {2068#false} is VALID [2022-02-20 18:50:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:59,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:59,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947680276] [2022-02-20 18:50:59,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947680276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:59,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:59,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:59,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518240866] [2022-02-20 18:50:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:59,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:59,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:59,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:59,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:59,616 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,008 INFO L93 Difference]: Finished difference Result 284 states and 361 transitions. [2022-02-20 18:51:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:51:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2022-02-20 18:51:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2022-02-20 18:51:00,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 361 transitions. [2022-02-20 18:51:00,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,246 INFO L225 Difference]: With dead ends: 284 [2022-02-20 18:51:00,246 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 18:51:00,247 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:00,247 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 514 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:00,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 129 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 18:51:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-02-20 18:51:00,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:00,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,366 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,366 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,369 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2022-02-20 18:51:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-02-20 18:51:00,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:00,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:00,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 156 states. [2022-02-20 18:51:00,370 INFO L87 Difference]: Start difference. First operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 156 states. [2022-02-20 18:51:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,372 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2022-02-20 18:51:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-02-20 18:51:00,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:00,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:00,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:00,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-02-20 18:51:00,376 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 48 [2022-02-20 18:51:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:00,376 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-02-20 18:51:00,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-02-20 18:51:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:51:00,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:00,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:00,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:00,377 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash -453133940, now seen corresponding path program 1 times [2022-02-20 18:51:00,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:00,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732249927] [2022-02-20 18:51:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:00,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {2926#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {2928#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:00,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2928#(<= (+ ~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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {2929#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {2930#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {2930#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {2930#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:00,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {2930#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:00,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {2931#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2932#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:00,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2932#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:00,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {2932#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {2932#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:00,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {2932#(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; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {2933#(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; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {2933#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {2933#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2934#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:51:00,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {2934#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {2927#false} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {2927#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {2927#false} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {2927#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2082~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2082~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; {2927#false} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {2927#false} assume 0 == main_~assert__arg~8#1 % 256; {2927#false} is VALID [2022-02-20 18:51:00,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {2927#false} assume !false; {2927#false} is VALID [2022-02-20 18:51:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:00,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:00,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732249927] [2022-02-20 18:51:00,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732249927] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:00,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:00,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:00,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608038627] [2022-02-20 18:51:00,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:51:00,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:00,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:00,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:00,576 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,265 INFO L93 Difference]: Finished difference Result 331 states and 434 transitions. [2022-02-20 18:51:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:02,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:51:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 434 transitions. [2022-02-20 18:51:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 434 transitions. [2022-02-20 18:51:02,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 434 transitions. [2022-02-20 18:51:02,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:02,624 INFO L225 Difference]: With dead ends: 331 [2022-02-20 18:51:02,625 INFO L226 Difference]: Without dead ends: 326 [2022-02-20 18:51:02,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:02,626 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 646 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:02,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 616 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-02-20 18:51:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 156. [2022-02-20 18:51:02,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:02,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 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:02,799 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 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:02,800 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 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:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,806 INFO L93 Difference]: Finished difference Result 326 states and 429 transitions. [2022-02-20 18:51:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 429 transitions. [2022-02-20 18:51:02,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:02,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:02,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 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 326 states. [2022-02-20 18:51:02,808 INFO L87 Difference]: Start difference. First operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 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 326 states. [2022-02-20 18:51:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,813 INFO L93 Difference]: Finished difference Result 326 states and 429 transitions. [2022-02-20 18:51:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 429 transitions. [2022-02-20 18:51:02,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:02,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:02,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:02,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 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:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2022-02-20 18:51:02,816 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 49 [2022-02-20 18:51:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:02,817 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2022-02-20 18:51:02,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2022-02-20 18:51:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:51:02,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:02,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:02,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:02,818 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:02,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1459063162, now seen corresponding path program 1 times [2022-02-20 18:51:02,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:02,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856350419] [2022-02-20 18:51:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:02,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {4228#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {4230#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:02,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {4230#(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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {4231#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {4231#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {4231#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {4232#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {4232#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {4232#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {4232#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {4233#(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; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {4233#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {4233#(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; {4234#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:02,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {4234#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4234#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:02,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {4234#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {4234#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:02,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {4234#(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; {4234#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:02,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {4234#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4234#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:02,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {4234#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {4234#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:02,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {4234#(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; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 3); {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {4235#(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; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {4235#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:02,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {4235#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4236#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:51:02,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {4236#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {4229#false} is VALID [2022-02-20 18:51:02,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {4229#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {4229#false} is VALID [2022-02-20 18:51:02,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {4229#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4229#false} is VALID [2022-02-20 18:51:02,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {4229#false} assume main_~node3__m3~4#1 != ~nomsg~0; {4229#false} is VALID [2022-02-20 18:51:02,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {4229#false} assume !(main_~node3__m3~4#1 > ~id3~0); {4229#false} is VALID [2022-02-20 18:51:02,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {4229#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {4229#false} is VALID [2022-02-20 18:51:02,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {4229#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1893~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1893~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; {4229#false} is VALID [2022-02-20 18:51:02,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {4229#false} assume 0 == main_~assert__arg~7#1 % 256; {4229#false} is VALID [2022-02-20 18:51:02,989 INFO L290 TraceCheckUtils]: 48: Hoare triple {4229#false} assume !false; {4229#false} is VALID [2022-02-20 18:51:02,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:02,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:02,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856350419] [2022-02-20 18:51:02,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856350419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:02,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:02,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:02,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100751478] [2022-02-20 18:51:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:02,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:51:02,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:02,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:03,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:03,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:03,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:03,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:03,024 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,212 INFO L93 Difference]: Finished difference Result 390 states and 518 transitions. [2022-02-20 18:51:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:51:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 518 transitions. [2022-02-20 18:51:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 518 transitions. [2022-02-20 18:51:05,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 518 transitions. [2022-02-20 18:51:05,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,638 INFO L225 Difference]: With dead ends: 390 [2022-02-20 18:51:05,639 INFO L226 Difference]: Without dead ends: 330 [2022-02-20 18:51:05,639 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:05,640 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 1041 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 826 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:05,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1041 Valid, 826 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:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-20 18:51:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 156. [2022-02-20 18:51:05,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:05,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 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:05,837 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 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:05,851 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 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:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,856 INFO L93 Difference]: Finished difference Result 330 states and 434 transitions. [2022-02-20 18:51:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 434 transitions. [2022-02-20 18:51:05,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 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 330 states. [2022-02-20 18:51:05,858 INFO L87 Difference]: Start difference. First operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 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 330 states. [2022-02-20 18:51:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,863 INFO L93 Difference]: Finished difference Result 330 states and 434 transitions. [2022-02-20 18:51:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 434 transitions. [2022-02-20 18:51:05,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:05,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 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:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2022-02-20 18:51:05,866 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 49 [2022-02-20 18:51:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:05,866 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2022-02-20 18:51:05,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2022-02-20 18:51:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:51:05,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:05,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:05,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:05,868 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:05,869 INFO L85 PathProgramCache]: Analyzing trace with hash 8857914, now seen corresponding path program 1 times [2022-02-20 18:51:05,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:05,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880096102] [2022-02-20 18:51:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:05,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {5616#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {5618#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:05,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {5618#(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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {5619#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {5620#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {5620#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {5620#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {5620#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:06,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {5621#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {5622#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {5622#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 3); {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {5622#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {5622#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {5622#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {5622#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {5622#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {5622#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:06,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {5622#(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; {5623#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:06,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {5623#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {5617#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {5617#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {5617#false} assume main_~node2__m2~1#1 != ~nomsg~0; {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {5617#false} assume !(main_~node2__m2~1#1 > ~id2~0); {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {5617#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {5617#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {5617#false} assume main_~node3__m3~3#1 != ~nomsg~0; {5617#false} is VALID [2022-02-20 18:51:06,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {5617#false} assume !(main_~node3__m3~3#1 > ~id3~0); {5617#false} is VALID [2022-02-20 18:51:06,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {5617#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {5617#false} is VALID [2022-02-20 18:51:06,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {5617#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2162~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2162~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; {5617#false} is VALID [2022-02-20 18:51:06,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {5617#false} assume 0 == main_~assert__arg~5#1 % 256; {5617#false} is VALID [2022-02-20 18:51:06,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {5617#false} assume !false; {5617#false} is VALID [2022-02-20 18:51:06,020 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:06,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:06,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880096102] [2022-02-20 18:51:06,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880096102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:06,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:06,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:51:06,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796382424] [2022-02-20 18:51:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:06,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:51:06,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:06,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:06,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:51:06,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:06,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:51:06,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:06,054 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:07,243 INFO L93 Difference]: Finished difference Result 311 states and 391 transitions. [2022-02-20 18:51:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:51:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:51:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 391 transitions. [2022-02-20 18:51:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 391 transitions. [2022-02-20 18:51:07,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 391 transitions. [2022-02-20 18:51:07,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:07,502 INFO L225 Difference]: With dead ends: 311 [2022-02-20 18:51:07,502 INFO L226 Difference]: Without dead ends: 228 [2022-02-20 18:51:07,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:51:07,504 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 841 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:07,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [841 Valid, 370 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-02-20 18:51:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 156. [2022-02-20 18:51:07,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:07,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 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:07,698 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 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:07,699 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 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:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:07,701 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2022-02-20 18:51:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2022-02-20 18:51:07,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:07,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:07,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 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 228 states. [2022-02-20 18:51:07,703 INFO L87 Difference]: Start difference. First operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 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 228 states. [2022-02-20 18:51:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:07,705 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2022-02-20 18:51:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2022-02-20 18:51:07,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:07,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:07,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:07,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 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:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2022-02-20 18:51:07,708 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 49 [2022-02-20 18:51:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:07,708 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2022-02-20 18:51:07,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2022-02-20 18:51:07,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:07,709 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:07,709 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:51:07,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:51:07,709 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1308237609, now seen corresponding path program 1 times [2022-02-20 18:51:07,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:07,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006108195] [2022-02-20 18:51:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:08,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {6674#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {6674#true} is VALID [2022-02-20 18:51:08,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {6674#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {6676#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:08,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {6676#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {6676#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:08,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {6676#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {6677#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:08,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {6677#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {6677#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:08,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {6677#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {6678#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:51:08,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {6678#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} assume 0 == ~mode1~0 % 256; {6678#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:51:08,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {6678#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} assume ~id2~0 >= 0; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~st2~0; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume 0 == ~mode3~0 % 256; {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:08,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {6679#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} assume ~id1~0 != ~id2~0; {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:08,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~id1~0 != ~id3~0; {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:08,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:08,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:08,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:08,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~send1~0 != ~nomsg~0; {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:51:08,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {6680#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:08,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:08,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:08,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:08,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:08,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:08,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {6681#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 % 256 >= 3); {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == main_~assert__arg~0#1 % 256); {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode1~0 % 256); {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {6682#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {6683#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {6683#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0; {6683#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {6683#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6683#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:08,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {6683#(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; {6684#(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:08,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {6684#(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; {6684#(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:08,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {6684#(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); {6685#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:08,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {6685#(<= (+ |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~3#1;main_~node3__m3~3#1 := ~nomsg~0; {6675#false} is VALID [2022-02-20 18:51:08,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {6675#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6675#false} is VALID [2022-02-20 18:51:08,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {6675#false} assume main_~node3__m3~3#1 != ~nomsg~0; {6675#false} is VALID [2022-02-20 18:51:08,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {6675#false} assume !(main_~node3__m3~3#1 > ~id3~0); {6675#false} is VALID [2022-02-20 18:51:08,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {6675#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {6675#false} is VALID [2022-02-20 18:51:08,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {6675#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2162~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2162~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; {6675#false} is VALID [2022-02-20 18:51:08,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {6675#false} assume 0 == main_~assert__arg~5#1 % 256; {6675#false} is VALID [2022-02-20 18:51:08,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {6675#false} assume !false; {6675#false} is VALID [2022-02-20 18:51:08,065 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:08,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:08,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006108195] [2022-02-20 18:51:08,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006108195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:08,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:08,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:08,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271320017] [2022-02-20 18:51:08,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:08,066 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:51:08,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:08,066 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:51:08,103 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:51:08,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:08,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:08,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:08,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:08,103 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:11,862 INFO L93 Difference]: Finished difference Result 434 states and 582 transitions. [2022-02-20 18:51:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:11,862 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:51:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 582 transitions. [2022-02-20 18:51:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 582 transitions. [2022-02-20 18:51:11,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 582 transitions. [2022-02-20 18:51:12,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 582 edges. 582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,357 INFO L225 Difference]: With dead ends: 434 [2022-02-20 18:51:12,357 INFO L226 Difference]: Without dead ends: 418 [2022-02-20 18:51:12,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:51:12,358 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 1228 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:12,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1228 Valid, 2266 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-02-20 18:51:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 140. [2022-02-20 18:51:12,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:12,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 418 states. Second operand has 140 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 139 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,662 INFO L74 IsIncluded]: Start isIncluded. First operand 418 states. Second operand has 140 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 139 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,662 INFO L87 Difference]: Start difference. First operand 418 states. Second operand has 140 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 139 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,669 INFO L93 Difference]: Finished difference Result 418 states and 563 transitions. [2022-02-20 18:51:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 563 transitions. [2022-02-20 18:51:12,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:12,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:12,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 139 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 418 states. [2022-02-20 18:51:12,670 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 139 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 418 states. [2022-02-20 18:51:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,679 INFO L93 Difference]: Finished difference Result 418 states and 563 transitions. [2022-02-20 18:51:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 563 transitions. [2022-02-20 18:51:12,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:12,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:12,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:12,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 139 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2022-02-20 18:51:12,686 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 51 [2022-02-20 18:51:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:12,686 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2022-02-20 18:51:12,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2022-02-20 18:51:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:12,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:12,687 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:51:12,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:12,687 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 766441193, now seen corresponding path program 1 times [2022-02-20 18:51:12,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:12,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891296125] [2022-02-20 18:51:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:13,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {8282#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {8282#true} is VALID [2022-02-20 18:51:13,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {8282#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {8284#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:13,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {8284#(<= ~send1~0 127)} assume 0 == ~r1~0 % 256; {8284#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:13,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {8284#(<= ~send1~0 127)} assume ~id1~0 >= 0; {8285#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:13,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {8285#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {8285#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:13,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {8285#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {8286#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:13,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {8286#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {8286#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:13,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {8286#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {8287#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:13,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {8287#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {8287#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:13,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {8287#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {8288#(and (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {8288#(and (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume 0 == ~mode2~0 % 256; {8288#(and (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {8288#(and (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~id3~0 >= 0; {8289#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {8289#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume 0 == ~st3~0; {8289#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {8289#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~send3~0 == ~id3~0; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume 0 == ~mode3~0 % 256; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~id1~0 != ~id2~0; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~id1~0 != ~id3~0; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~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; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~send1~0 != ~nomsg~0; {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {8290#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0) (+ ~send3~0 ~send2~0 127)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~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; {8291#(or (and (<= 0 ~id3~0) (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= (+ ~send3~0 ~send2~0 (* (div (+ ~id1~0 ~id3~0 (* (- 1) ~send2~0) 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:13,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {8291#(or (and (<= 0 ~id3~0) (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= (+ ~send3~0 ~send2~0 (* (div (+ ~id1~0 ~id3~0 (* (- 1) ~send2~0) 128 (* (- 1) ~send3~0)) 256) 256) ~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; {8291#(or (and (<= 0 ~id3~0) (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= (+ ~send3~0 ~send2~0 (* (div (+ ~id1~0 ~id3~0 (* (- 1) ~send2~0) 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:13,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {8291#(or (and (<= 0 ~id3~0) (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= (+ ~send3~0 ~send2~0 (* (div (+ ~id1~0 ~id3~0 (* (- 1) ~send2~0) 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {8291#(or (and (<= 0 ~id3~0) (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= (+ ~send3~0 ~send2~0 (* (div (+ ~id1~0 ~id3~0 (* (- 1) ~send2~0) 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:13,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {8291#(or (and (<= 0 ~id3~0) (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= (+ ~send3~0 ~send2~0 (* (div (+ ~id1~0 ~id3~0 (* (- 1) ~send2~0) 128 (* (- 1) ~send3~0)) 256) 256) ~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; {8292#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 (* (div (+ (* (- 1) ~p2_new~0) ~id1~0 ~id3~0 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:13,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {8292#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 (* (div (+ (* (- 1) ~p2_new~0) ~id1~0 ~id3~0 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8292#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 (* (div (+ (* (- 1) ~p2_new~0) ~id1~0 ~id3~0 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:13,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {8292#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 (* (div (+ (* (- 1) ~p2_new~0) ~id1~0 ~id3~0 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))))} assume ~send3~0 != ~nomsg~0; {8292#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 (* (div (+ (* (- 1) ~p2_new~0) ~id1~0 ~id3~0 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:13,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {8292#(or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~send3~0 (* (div (+ (* (- 1) ~p2_new~0) ~id1~0 ~id3~0 128 (* (- 1) ~send3~0)) 256) 256) ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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; {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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); {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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; {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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); {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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); {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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:13,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {8293#(or (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~id1~0 ~id3~0 129) (+ ~p3_old~0 ~p2_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; {8294#(or (<= (+ ~id1~0 ~id3~0 129) (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_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) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {8294#(or (<= (+ ~id1~0 ~id3~0 129) (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_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) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {8294#(or (<= (+ ~id1~0 ~id3~0 129) (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_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) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {8294#(or (<= (+ ~id1~0 ~id3~0 129) (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_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) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {8295#(or (<= (+ ~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) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:13,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {8295#(or (<= (+ ~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) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {8296#(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:13,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {8296#(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~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8297#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:13,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {8297#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {8297#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:13,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {8297#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {8298#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:13,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {8298#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {8298#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:13,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {8298#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {8298#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:13,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {8298#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8299#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:13,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {8299#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {8299#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:13,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {8299#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {8300#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:13,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {8300#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {8283#false} is VALID [2022-02-20 18:51:13,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {8283#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1893~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1893~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; {8283#false} is VALID [2022-02-20 18:51:13,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {8283#false} assume 0 == main_~assert__arg~7#1 % 256; {8283#false} is VALID [2022-02-20 18:51:13,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2022-02-20 18:51:13,227 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:13,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:13,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891296125] [2022-02-20 18:51:13,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891296125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:13,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:13,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:13,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317854169] [2022-02-20 18:51:13,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:13,228 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:51:13,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:13,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:51:13,268 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:51:13,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:13,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:13,269 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:51:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:18,703 INFO L93 Difference]: Finished difference Result 403 states and 524 transitions. [2022-02-20 18:51:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 18:51:18,704 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:51:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:51:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 524 transitions. [2022-02-20 18:51:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:51:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 524 transitions. [2022-02-20 18:51:18,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 524 transitions. [2022-02-20 18:51:19,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:19,085 INFO L225 Difference]: With dead ends: 403 [2022-02-20 18:51:19,085 INFO L226 Difference]: Without dead ends: 356 [2022-02-20 18:51:19,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 18:51:19,086 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 1209 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:19,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1209 Valid, 2180 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 18:51:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-20 18:51:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 146. [2022-02-20 18:51:19,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:19,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 145 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call 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,485 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 145 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call 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,485 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 145 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call 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,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:19,490 INFO L93 Difference]: Finished difference Result 356 states and 455 transitions. [2022-02-20 18:51:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2022-02-20 18:51:19,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:19,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:19,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 145 states have internal predecessors, (180), 0 states have call successors, (0), 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 356 states. [2022-02-20 18:51:19,491 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 145 states have internal predecessors, (180), 0 states have call successors, (0), 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 356 states. [2022-02-20 18:51:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:19,495 INFO L93 Difference]: Finished difference Result 356 states and 455 transitions. [2022-02-20 18:51:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 455 transitions. [2022-02-20 18:51:19,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:19,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:19,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:19,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 145 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call 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,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2022-02-20 18:51:19,498 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 51 [2022-02-20 18:51:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:19,498 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2022-02-20 18:51:19,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 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:51:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2022-02-20 18:51:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:19,499 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:19,499 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:51:19,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:19,499 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1014075955, now seen corresponding path program 1 times [2022-02-20 18:51:19,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:19,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036890772] [2022-02-20 18:51:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:19,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {9746#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {9746#true} is VALID [2022-02-20 18:51:19,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {9746#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {9748#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:19,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {9748#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {9748#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:19,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {9748#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {9749#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:19,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {9749#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {9749#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:19,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {9749#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {9750#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~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:19,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {9750#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~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; {9750#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~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:19,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {9750#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~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 >= 0; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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:19,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {9751#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~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; {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~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:19,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id3~0; {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~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:19,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~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_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~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:19,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~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; {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~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:19,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~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; {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~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:19,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send1~0 != ~nomsg~0; {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~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:19,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {9752#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~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; {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:19,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:19,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:19,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~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; {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:19,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:19,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:19,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {9753#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~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; {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(~r1~0 % 256 >= 3); {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(0 == main_~assert__arg~0#1 % 256); {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(0 == ~mode1~0 % 256); {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~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; {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~node1__m1~1#1 != ~nomsg~0; {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(main_~node1__m1~1#1 > ~id1~0); {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:19,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {9754#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {9755#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:19,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {9755#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9756#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:19,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {9756#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {9756#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:19,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {9756#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~3#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {9757#(<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:19,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {9757#(<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0)} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {9747#false} is VALID [2022-02-20 18:51:19,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {9747#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9747#false} is VALID [2022-02-20 18:51:19,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {9747#false} assume main_~node3__m3~5#1 != ~nomsg~0; {9747#false} is VALID [2022-02-20 18:51:19,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {9747#false} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {9747#false} is VALID [2022-02-20 18:51:19,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {9747#false} ~mode3~0 := 0; {9747#false} is VALID [2022-02-20 18:51:19,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {9747#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {9747#false} is VALID [2022-02-20 18:51:19,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {9747#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2082~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2082~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; {9747#false} is VALID [2022-02-20 18:51:19,841 INFO L290 TraceCheckUtils]: 49: Hoare triple {9747#false} assume 0 == main_~assert__arg~8#1 % 256; {9747#false} is VALID [2022-02-20 18:51:19,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {9747#false} assume !false; {9747#false} is VALID [2022-02-20 18:51:19,841 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,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:19,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036890772] [2022-02-20 18:51:19,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036890772] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:19,842 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:19,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:19,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150246233] [2022-02-20 18:51:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:19,843 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:51:19,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:19,843 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:51:19,880 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:51:19,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:19,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:19,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:19,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:19,881 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:22,939 INFO L93 Difference]: Finished difference Result 351 states and 472 transitions. [2022-02-20 18:51:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:22,939 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:51:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 472 transitions. [2022-02-20 18:51:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 472 transitions. [2022-02-20 18:51:22,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 472 transitions. [2022-02-20 18:51:23,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:23,362 INFO L225 Difference]: With dead ends: 351 [2022-02-20 18:51:23,362 INFO L226 Difference]: Without dead ends: 297 [2022-02-20 18:51:23,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:51:23,364 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 896 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:23,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 1414 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-02-20 18:51:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 135. [2022-02-20 18:51:23,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:23,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call 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,766 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call 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,766 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call 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,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,771 INFO L93 Difference]: Finished difference Result 297 states and 395 transitions. [2022-02-20 18:51:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 395 transitions. [2022-02-20 18:51:23,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 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 297 states. [2022-02-20 18:51:23,772 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 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 297 states. [2022-02-20 18:51:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,776 INFO L93 Difference]: Finished difference Result 297 states and 395 transitions. [2022-02-20 18:51:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 395 transitions. [2022-02-20 18:51:23,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:23,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 134 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call 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,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2022-02-20 18:51:23,778 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 51 [2022-02-20 18:51:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:23,778 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2022-02-20 18:51:23,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2022-02-20 18:51:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:23,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:23,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:23,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:23,779 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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:23,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1721906586, now seen corresponding path program 1 times [2022-02-20 18:51:23,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:23,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160195823] [2022-02-20 18:51:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:23,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {11001#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:23,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {11001#(<= (+ ~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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {11002#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {11002#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {11002#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {11002#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {11003#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {11003#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {11003#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {11003#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:23,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {11004#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11005#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:23,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {11005#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11005#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:23,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {11005#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {11005#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:23,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {11005#(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; {11005#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:23,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {11005#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11005#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:23,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {11005#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {11005#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:23,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {11005#(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; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 3); {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {11006#(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; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {11006#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:23,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {11006#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11007#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:23,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {11007#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {11000#false} is VALID [2022-02-20 18:51:23,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {11000#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {11000#false} is VALID [2022-02-20 18:51:23,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {11000#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11000#false} is VALID [2022-02-20 18:51:23,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {11000#false} assume main_~node3__m3~1#1 != ~nomsg~0; {11000#false} is VALID [2022-02-20 18:51:23,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {11000#false} assume !(main_~node3__m3~1#1 > ~id3~0); {11000#false} is VALID [2022-02-20 18:51:23,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {11000#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {11000#false} is VALID [2022-02-20 18:51:23,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {11000#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11000#false} is VALID [2022-02-20 18:51:23,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {11000#false} assume !(~r1~0 % 256 >= 3); {11000#false} is VALID [2022-02-20 18:51:23,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {11000#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1827~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1827~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; {11000#false} is VALID [2022-02-20 18:51:23,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {11000#false} assume 0 == main_~assert__arg~3#1 % 256; {11000#false} is VALID [2022-02-20 18:51:23,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-02-20 18:51:23,901 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,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:23,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160195823] [2022-02-20 18:51:23,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160195823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:23,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:23,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:23,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401960855] [2022-02-20 18:51:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:23,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:23,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:23,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:23,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:23,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:23,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:23,933 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,122 INFO L93 Difference]: Finished difference Result 354 states and 476 transitions. [2022-02-20 18:51:26,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:26,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 468 transitions. [2022-02-20 18:51:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 468 transitions. [2022-02-20 18:51:26,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 468 transitions. [2022-02-20 18:51:26,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:26,608 INFO L225 Difference]: With dead ends: 354 [2022-02-20 18:51:26,608 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 18:51:26,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:26,609 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 541 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:26,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 650 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 18:51:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 135. [2022-02-20 18:51:27,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:27,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 135 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 134 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:27,004 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 135 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 134 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:27,005 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 135 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 134 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:27,008 INFO L93 Difference]: Finished difference Result 293 states and 390 transitions. [2022-02-20 18:51:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 390 transitions. [2022-02-20 18:51:27,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:27,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:27,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 134 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 293 states. [2022-02-20 18:51:27,009 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 134 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 293 states. [2022-02-20 18:51:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:27,012 INFO L93 Difference]: Finished difference Result 293 states and 390 transitions. [2022-02-20 18:51:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 390 transitions. [2022-02-20 18:51:27,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:27,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:27,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:27,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 134 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2022-02-20 18:51:27,014 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 52 [2022-02-20 18:51:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:27,015 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2022-02-20 18:51:27,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2022-02-20 18:51:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:27,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:27,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:27,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:27,016 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1294616090, now seen corresponding path program 1 times [2022-02-20 18:51:27,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:27,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34200647] [2022-02-20 18:51:27,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:27,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {12250#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {12252#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:27,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {12252#(<= (+ ~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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {12254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {12254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {12254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:27,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {12254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:27,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {12255#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12256#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:27,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {12256#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12256#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:27,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {12256#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {12256#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:27,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {12256#(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; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {12257#(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; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {12257#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:27,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {12257#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12258#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:51:27,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {12258#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {12251#false} is VALID [2022-02-20 18:51:27,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {12251#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {12251#false} is VALID [2022-02-20 18:51:27,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {12251#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12251#false} is VALID [2022-02-20 18:51:27,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {12251#false} assume !(~r1~0 % 256 >= 3); {12251#false} is VALID [2022-02-20 18:51:27,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {12251#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1744~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1744~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; {12251#false} is VALID [2022-02-20 18:51:27,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {12251#false} assume 0 == main_~assert__arg~6#1 % 256; {12251#false} is VALID [2022-02-20 18:51:27,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {12251#false} assume !false; {12251#false} is VALID [2022-02-20 18:51:27,148 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:27,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:27,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34200647] [2022-02-20 18:51:27,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34200647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:27,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:27,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:27,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736792195] [2022-02-20 18:51:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:27,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:27,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:27,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:27,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:27,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:27,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:27,183 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,310 INFO L93 Difference]: Finished difference Result 302 states and 396 transitions. [2022-02-20 18:51:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 396 transitions. [2022-02-20 18:51:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 396 transitions. [2022-02-20 18:51:29,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 396 transitions. [2022-02-20 18:51:29,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:29,581 INFO L225 Difference]: With dead ends: 302 [2022-02-20 18:51:29,581 INFO L226 Difference]: Without dead ends: 295 [2022-02-20 18:51:29,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:29,582 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 1102 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:29,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 512 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-02-20 18:51:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 135. [2022-02-20 18:51:29,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:29,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 135 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call 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,980 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 135 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call 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,981 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 135 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call 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,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,984 INFO L93 Difference]: Finished difference Result 295 states and 388 transitions. [2022-02-20 18:51:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 388 transitions. [2022-02-20 18:51:29,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:29,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:29,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 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 295 states. [2022-02-20 18:51:29,985 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 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 295 states. [2022-02-20 18:51:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:29,988 INFO L93 Difference]: Finished difference Result 295 states and 388 transitions. [2022-02-20 18:51:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 388 transitions. [2022-02-20 18:51:29,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:29,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:29,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:29,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call 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,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-02-20 18:51:29,990 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 52 [2022-02-20 18:51:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:29,990 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-02-20 18:51:29,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-02-20 18:51:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:29,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:29,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:29,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:29,991 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:51:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1671010270, now seen corresponding path program 1 times [2022-02-20 18:51:29,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:29,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515210494] [2022-02-20 18:51:29,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:29,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:30,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {13434#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {13434#true} is VALID [2022-02-20 18:51:30,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {13434#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {13436#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:30,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {13436#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume 0 == ~r1~0 % 256; {13436#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:30,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {13436#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume ~id1~0 >= 0; {13437#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:30,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {13437#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume 0 == ~st1~0; {13437#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:30,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {13437#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume ~send1~0 == ~id1~0; {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume 0 == ~st2~0; {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {13438#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {13439#(and (<= (+ ~send2~0 ~send1~0) 254) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {13439#(and (<= (+ ~send2~0 ~send1~0) 254) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {13439#(and (<= (+ ~send2~0 ~send1~0) 254) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {13439#(and (<= (+ ~send2~0 ~send1~0) 254) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume 0 == ~st3~0; {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {13440#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 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; {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:30,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {13441#(and (<= 0 ~id3~0) (<= (+ ~send2~0 ~send1~0) (+ ~id3~0 254)) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= ~send1~0 127) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (not (<= ~id2~0 ~id3~0)) (<= ~id2~0 ~send2~0))) (<= 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; {13442#(and (<= 0 ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (<= (+ ~send2~0 (* 256 (div (+ 255 ~id2~0 (* (- 1) ~send2~0)) 256))) (+ ~id3~0 254)) (not (<= ~id2~0 ~id3~0)))))} is VALID [2022-02-20 18:51:30,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {13442#(and (<= 0 ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (<= (+ ~send2~0 (* 256 (div (+ 255 ~id2~0 (* (- 1) ~send2~0)) 256))) (+ ~id3~0 254)) (not (<= ~id2~0 ~id3~0)))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13442#(and (<= 0 ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (<= (+ ~send2~0 (* 256 (div (+ 255 ~id2~0 (* (- 1) ~send2~0)) 256))) (+ ~id3~0 254)) (not (<= ~id2~0 ~id3~0)))))} is VALID [2022-02-20 18:51:30,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {13442#(and (<= 0 ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (<= (+ ~send2~0 (* 256 (div (+ 255 ~id2~0 (* (- 1) ~send2~0)) 256))) (+ ~id3~0 254)) (not (<= ~id2~0 ~id3~0)))))} assume ~send2~0 != ~nomsg~0; {13442#(and (<= 0 ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (<= (+ ~send2~0 (* 256 (div (+ 255 ~id2~0 (* (- 1) ~send2~0)) 256))) (+ ~id3~0 254)) (not (<= ~id2~0 ~id3~0)))))} is VALID [2022-02-20 18:51:30,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {13442#(and (<= 0 ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= (+ ~id2~0 1) ~id3~0) (and (<= (+ ~send2~0 (* 256 (div (+ 255 ~id2~0 (* (- 1) ~send2~0)) 256))) (+ ~id3~0 254)) (not (<= ~id2~0 ~id3~0)))))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13443#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:30,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {13443#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13443#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:30,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {13443#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)))} assume ~send3~0 != ~nomsg~0; {13443#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:30,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {13443#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= ~id2~0 ~p2_new~0) (not (<= ~id2~0 ~id3~0))) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(~r1~0 % 256 >= 3); {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == main_~assert__arg~0#1 % 256); {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode1~0 % 256); {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~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; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node1__m1~1#1 > ~id1~0); {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {13444#(or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13445#(or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {13445#(or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume main_~node2__m2~3#1 != ~nomsg~0; {13445#(or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {13445#(or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0)) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node2__m2~3#1 > ~id2~0); {13446#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:30,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {13446#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0) (and (<= ~id2~0 ~p2_old~0) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node2__m2~3#1 == ~id2~0); {13447#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {13447#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {13447#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {13447#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {13447#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:30,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {13447#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13448#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:30,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {13448#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume main_~node3__m3~4#1 != ~nomsg~0; {13448#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:30,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {13448#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~4#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0))} assume !(main_~node3__m3~4#1 > ~id3~0); {13449#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:30,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {13449#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {13435#false} is VALID [2022-02-20 18:51:30,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {13435#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1893~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1893~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; {13435#false} is VALID [2022-02-20 18:51:30,434 INFO L290 TraceCheckUtils]: 50: Hoare triple {13435#false} assume 0 == main_~assert__arg~7#1 % 256; {13435#false} is VALID [2022-02-20 18:51:30,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {13435#false} assume !false; {13435#false} is VALID [2022-02-20 18:51:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:30,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:30,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515210494] [2022-02-20 18:51:30,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515210494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:30,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:30,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-20 18:51:30,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181297276] [2022-02-20 18:51:30,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:30,435 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:30,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:30,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:30,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 18:51:30,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 18:51:30,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:51:30,474 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:35,697 INFO L93 Difference]: Finished difference Result 324 states and 419 transitions. [2022-02-20 18:51:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 18:51:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:51:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 419 transitions. [2022-02-20 18:51:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 419 transitions. [2022-02-20 18:51:35,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 419 transitions. [2022-02-20 18:51:36,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:36,010 INFO L225 Difference]: With dead ends: 324 [2022-02-20 18:51:36,011 INFO L226 Difference]: Without dead ends: 277 [2022-02-20 18:51:36,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2022-02-20 18:51:36,011 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 702 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:36,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [702 Valid, 2721 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:51:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-02-20 18:51:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 125. [2022-02-20 18:51:36,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:36,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,486 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,486 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:36,489 INFO L93 Difference]: Finished difference Result 277 states and 350 transitions. [2022-02-20 18:51:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 350 transitions. [2022-02-20 18:51:36,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:36,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:36,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 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 277 states. [2022-02-20 18:51:36,490 INFO L87 Difference]: Start difference. First operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 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 277 states. [2022-02-20 18:51:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:36,493 INFO L93 Difference]: Finished difference Result 277 states and 350 transitions. [2022-02-20 18:51:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 350 transitions. [2022-02-20 18:51:36,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:36,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:36,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:36,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2022-02-20 18:51:36,495 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 52 [2022-02-20 18:51:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:36,495 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2022-02-20 18:51:36,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-02-20 18:51:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:36,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:36,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:36,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:36,496 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:51:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1899159370, now seen corresponding path program 1 times [2022-02-20 18:51:36,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:36,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763376230] [2022-02-20 18:51:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:36,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {14605#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {14605#true} is VALID [2022-02-20 18:51:36,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {14605#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {14607#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:36,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {14607#(<= ~id3~0 127)} assume 0 == ~r1~0 % 256; {14607#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:36,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {14607#(<= ~id3~0 127)} assume ~id1~0 >= 0; {14608#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:36,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {14608#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {14608#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:36,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {14608#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {14609#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {14609#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {14609#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {14609#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {14610#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {14610#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {14610#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {14610#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {14611#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {14611#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {14611#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {14611#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {14612#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {14612#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {14612#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {14612#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~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; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:36,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {14613#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~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; {14614#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:36,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {14614#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14614#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:36,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {14614#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {14614#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:36,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {14614#(and (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 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; {14615#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~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)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:36,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {14615#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~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)) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14615#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~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)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:36,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {14615#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~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)) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {14615#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~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)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:36,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {14615#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~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)) (<= 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; {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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; {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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); {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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; {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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); {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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); {14616#(or (<= (+ ~id3~0 129) ~p2_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:36,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {14616#(or (<= (+ ~id3~0 129) ~p2_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; {14617#(or (<= (+ ~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:36,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {14617#(or (<= (+ ~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; {14617#(or (<= (+ ~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:36,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {14617#(or (<= (+ ~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; {14618#(or (<= (+ ~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:36,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {14618#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {14618#(or (<= (+ ~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:36,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {14618#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14618#(or (<= (+ ~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:36,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {14618#(or (<= (+ ~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~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14619#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:36,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {14619#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {14619#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:36,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {14619#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {14620#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:36,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {14620#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {14620#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:36,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {14620#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14620#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:36,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {14620#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14621#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:36,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {14621#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {14621#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:36,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {14621#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {14622#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:36,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {14622#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {14606#false} is VALID [2022-02-20 18:51:36,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {14606#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14606#false} is VALID [2022-02-20 18:51:36,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {14606#false} assume !(~r1~0 % 256 >= 3); {14606#false} is VALID [2022-02-20 18:51:36,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {14606#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1827~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1827~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; {14606#false} is VALID [2022-02-20 18:51:36,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {14606#false} assume 0 == main_~assert__arg~3#1 % 256; {14606#false} is VALID [2022-02-20 18:51:36,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {14606#false} assume !false; {14606#false} is VALID [2022-02-20 18:51:36,899 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:36,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:36,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763376230] [2022-02-20 18:51:36,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763376230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:36,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:36,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:36,899 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923041684] [2022-02-20 18:51:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:36,900 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:36,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:36,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:36,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:36,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:36,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:36,941 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:43,065 INFO L93 Difference]: Finished difference Result 439 states and 577 transitions. [2022-02-20 18:51:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:51:43,065 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 577 transitions. [2022-02-20 18:51:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 577 transitions. [2022-02-20 18:51:43,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 577 transitions. [2022-02-20 18:51:43,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:43,461 INFO L225 Difference]: With dead ends: 439 [2022-02-20 18:51:43,461 INFO L226 Difference]: Without dead ends: 433 [2022-02-20 18:51:43,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2022-02-20 18:51:43,462 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 929 mSDsluCounter, 2791 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:43,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 3112 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 18:51:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-02-20 18:51:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 136. [2022-02-20 18:51:44,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:44,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 136 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 135 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:44,046 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 136 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 135 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:44,046 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 136 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 135 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,052 INFO L93 Difference]: Finished difference Result 433 states and 571 transitions. [2022-02-20 18:51:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 571 transitions. [2022-02-20 18:51:44,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 135 states have internal predecessors, (166), 0 states have call successors, (0), 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 433 states. [2022-02-20 18:51:44,053 INFO L87 Difference]: Start difference. First operand has 136 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 135 states have internal predecessors, (166), 0 states have call successors, (0), 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 433 states. [2022-02-20 18:51:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,059 INFO L93 Difference]: Finished difference Result 433 states and 571 transitions. [2022-02-20 18:51:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 571 transitions. [2022-02-20 18:51:44,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:44,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 135 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call 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:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2022-02-20 18:51:44,061 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 54 [2022-02-20 18:51:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:44,062 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2022-02-20 18:51:44,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2022-02-20 18:51:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:44,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:44,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:44,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:44,063 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1464456906, now seen corresponding path program 1 times [2022-02-20 18:51:44,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:44,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600639775] [2022-02-20 18:51:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:44,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:44,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {16263#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {16263#true} is VALID [2022-02-20 18:51:44,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {16263#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {16265#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:44,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {16265#(<= ~send1~0 127)} assume 0 == ~r1~0 % 256; {16265#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:44,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {16265#(<= ~send1~0 127)} assume ~id1~0 >= 0; {16266#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:44,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {16266#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {16266#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:44,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {16266#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {16267#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {16267#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {16267#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {16267#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {16268#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {16268#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {16268#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {16268#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {16269#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {16269#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {16269#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {16269#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {16270#(and (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {16270#(and (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {16270#(and (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:44,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {16270#(and (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume 0 == ~mode3~0 % 256; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~id1~0 != ~id2~0; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~id1~0 != ~id3~0; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~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; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} assume ~send1~0 != ~nomsg~0; {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {16271#(and (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0) (<= ~send1~0 (+ ~id1~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; {16272#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:44,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {16272#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16272#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:44,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {16272#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {16272#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:44,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {16272#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~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; {16273#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~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))} is VALID [2022-02-20 18:51:44,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {16273#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~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))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16273#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~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))} is VALID [2022-02-20 18:51:44,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {16273#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~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))} assume ~send3~0 != ~nomsg~0; {16273#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~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))} is VALID [2022-02-20 18:51:44,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {16273#(or (and (<= ~p1_new~0 (+ ~id1~0 ~id2~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))} 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; {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~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_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {16274#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p3_old~0 ~p1_old~0 1) (+ ~id1~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~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; {16275#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {16275#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {16275#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {16275#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {16276#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {16276#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| 1) (+ ~id1~0 ~id2~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {16277#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:44,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {16277#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16278#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:44,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {16278#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {16278#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:44,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {16278#(or (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {16279#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:44,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {16279#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0; {16279#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:44,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {16279#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {16279#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:44,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {16279#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16280#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {16280#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {16280#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {16280#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 > ~id3~0;~send3~0 := main_~node3__m3~4#1; {16264#false} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {16264#false} ~mode3~0 := 0; {16264#false} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {16264#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {16264#false} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {16264#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16264#false} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {16264#false} assume !(~r1~0 % 256 >= 3); {16264#false} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 51: Hoare triple {16264#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1744~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1744~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; {16264#false} is VALID [2022-02-20 18:51:44,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {16264#false} assume 0 == main_~assert__arg~6#1 % 256; {16264#false} is VALID [2022-02-20 18:51:44,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {16264#false} assume !false; {16264#false} is VALID [2022-02-20 18:51:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:44,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:44,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600639775] [2022-02-20 18:51:44,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600639775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:44,508 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:44,508 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:44,508 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648732400] [2022-02-20 18:51:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:44,509 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:44,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:44,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:44,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:44,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:44,547 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,032 INFO L93 Difference]: Finished difference Result 341 states and 436 transitions. [2022-02-20 18:51:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:51:50,032 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 428 transitions. [2022-02-20 18:51:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 428 transitions. [2022-02-20 18:51:50,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 428 transitions. [2022-02-20 18:51:50,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:50,329 INFO L225 Difference]: With dead ends: 341 [2022-02-20 18:51:50,329 INFO L226 Difference]: Without dead ends: 333 [2022-02-20 18:51:50,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2022-02-20 18:51:50,331 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 982 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:50,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 2739 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:51:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-02-20 18:51:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 141. [2022-02-20 18:51:50,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:50,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 141 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 140 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,985 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 141 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 140 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,985 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 141 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 140 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,989 INFO L93 Difference]: Finished difference Result 333 states and 428 transitions. [2022-02-20 18:51:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 428 transitions. [2022-02-20 18:51:50,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:50,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:50,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 140 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 333 states. [2022-02-20 18:51:50,990 INFO L87 Difference]: Start difference. First operand has 141 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 140 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 333 states. [2022-02-20 18:51:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,994 INFO L93 Difference]: Finished difference Result 333 states and 428 transitions. [2022-02-20 18:51:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 428 transitions. [2022-02-20 18:51:50,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:50,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:50,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:50,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 140 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2022-02-20 18:51:50,997 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 54 [2022-02-20 18:51:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:50,997 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2022-02-20 18:51:50,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2022-02-20 18:51:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:50,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:50,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:50,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:51:50,998 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2098262835, now seen corresponding path program 1 times [2022-02-20 18:51:50,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:50,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242034333] [2022-02-20 18:51:50,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:51,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {17592#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_1389~0 := 0;~__return_2195~0 := 0;~__return_1527~0 := 0;~__return_1594~0 := 0;~__return_1827~0 := 0;~__return_2004~0 := 0;~__return_2162~0 := 0;~__return_1744~0 := 0;~__return_1893~0 := 0;~__return_2082~0 := 0;~__return_2228~0 := 0;~__return_2129~0 := 0;~__return_2037~0 := 0;~__return_1956~0 := 0;~__return_1860~0 := 0;~__return_1791~0 := 0;~__return_1684~0 := 0;~__return_1462~0 := 0; {17592#true} is VALID [2022-02-20 18:51:51,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {17592#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_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~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; {17594#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:51,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {17594#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {17594#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:51,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {17594#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {17595#(and (<= 0 ~id1~0) (<= ~id1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:51,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {17595#(and (<= 0 ~id1~0) (<= ~id1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {17595#(and (<= 0 ~id1~0) (<= ~id1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:51,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {17595#(and (<= 0 ~id1~0) (<= ~id1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} assume 0 == ~st2~0; {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {17596#(and (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id3~0 127) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 (+ ~id1~0 127)) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {17597#(and (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {17597#(and (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {17597#(and (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {17597#(and (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {17598#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {17598#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} assume 0 == ~st3~0; {17598#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {17598#(and (<= 0 ~id3~0) (<= ~send2~0 (+ ~id1~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:51,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {17599#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (and (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0)))) (not (<= ~id2~0 ~id3~0))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1389~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1389~0; {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:51,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:51,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:51,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} assume ~send1~0 != ~nomsg~0; {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:51,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {17600#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (<= ~send1~0 127) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0) (<= 0 ~send1~0) (or (and (<= ~send2~0 ~id2~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 127)) (<= (+ ~id2~0 1) ~id3~0)) (not (<= ~id2~0 ~id3~0))))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {17601#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:51,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {17601#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17601#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:51,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {17601#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {17601#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)))) (<= ~send3~0 (+ ~id1~0 ~id3~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:51,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {17601#(and (<= (+ ~send3~0 ~send2~0) (+ ~id1~0 ~id3~0 127)) (<= 0 ~id1~0) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~send2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= (+ ~id3~0 ~id2~0) (+ ~send2~0 ~p1_new~0 127)))) (<= ~send3~0 (+ ~id1~0 ~id3~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; {17602#(and (<= 0 ~id1~0) (or (and (or (not (<= ~id2~0 ~id3~0)) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_new~0))) (<= (+ ~send3~0 ~p2_new~0 1) (+ ~id1~0 ~id3~0))) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:51,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {17602#(and (<= 0 ~id1~0) (or (and (or (not (<= ~id2~0 ~id3~0)) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_new~0))) (<= (+ ~send3~0 ~p2_new~0 1) (+ ~id1~0 ~id3~0))) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17602#(and (<= 0 ~id1~0) (or (and (or (not (<= ~id2~0 ~id3~0)) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_new~0))) (<= (+ ~send3~0 ~p2_new~0 1) (+ ~id1~0 ~id3~0))) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:51,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {17602#(and (<= 0 ~id1~0) (or (and (or (not (<= ~id2~0 ~id3~0)) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_new~0))) (<= (+ ~send3~0 ~p2_new~0 1) (+ ~id1~0 ~id3~0))) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {17602#(and (<= 0 ~id1~0) (or (and (or (not (<= ~id2~0 ~id3~0)) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_new~0))) (<= (+ ~send3~0 ~p2_new~0 1) (+ ~id1~0 ~id3~0))) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:51,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {17602#(and (<= 0 ~id1~0) (or (and (or (not (<= ~id2~0 ~id3~0)) (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_new~0 ~p2_new~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_new~0))) (<= (+ ~send3~0 ~p2_new~0 1) (+ ~id1~0 ~id3~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; {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume !(~r1~0 % 256 >= 3); {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2195~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2195~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; {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume !(0 == main_~assert__arg~0#1 % 256); {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume !(0 == ~mode1~0 % 256); {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {17603#(or (<= (+ ~p3_old~0 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ ~p3_old~0 ~p2_old~0 1) (+ ~id1~0 ~id3~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; {17604#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {17604#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {17604#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:51,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {17604#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))) (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0 1) (+ ~id1~0 ~id3~0)))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {17605#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))))} is VALID [2022-02-20 18:51:51,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {17605#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))))} ~mode1~0 := 0; {17605#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))))} is VALID [2022-02-20 18:51:51,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {17605#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {17605#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))))} is VALID [2022-02-20 18:51:51,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {17605#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= (+ ~id3~0 ~id2~0 129) (+ ~p1_old~0 ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17606#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0)) (or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0)))))} is VALID [2022-02-20 18:51:51,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {17606#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0)) (or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0)))))} assume main_~node2__m2~1#1 != ~nomsg~0; {17606#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0)) (or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0)))))} is VALID [2022-02-20 18:51:51,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {17606#(or (<= (+ 2 ~p2_old~0) ~id3~0) (and (or (<= ~id2~0 ~id3~0) (<= ~id2~0 ~p2_old~0)) (or (<= (+ ~id3~0 ~id2~0 129) (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0)))))} assume !(main_~node2__m2~1#1 > ~id2~0); {17607#(or (and (or (<= (+ ~id3~0 129) ~p2_old~0) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 ~p2_old~0)) (<= (+ 2 ~p2_old~0) ~id3~0))} is VALID [2022-02-20 18:51:51,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {17607#(or (and (or (<= (+ ~id3~0 129) ~p2_old~0) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (<= ~id2~0 ~p2_old~0)) (<= (+ 2 ~p2_old~0) ~id3~0))} assume !(main_~node2__m2~1#1 == ~id2~0); {17608#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:51,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {17608#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {17608#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:51,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {17608#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {17608#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:51,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {17608#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17609#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:51,763 INFO L290 TraceCheckUtils]: 47: Hoare triple {17609#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {17609#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:51,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {17609#(or (<= (+ ~id3~0 1) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {17610#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:51,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {17610#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {17593#false} is VALID [2022-02-20 18:51:51,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {17593#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17593#false} is VALID [2022-02-20 18:51:51,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {17593#false} assume !(~r1~0 % 256 >= 3); {17593#false} is VALID [2022-02-20 18:51:51,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {17593#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1827~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1827~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; {17593#false} is VALID [2022-02-20 18:51:51,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {17593#false} assume 0 == main_~assert__arg~3#1 % 256; {17593#false} is VALID [2022-02-20 18:51:51,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {17593#false} assume !false; {17593#false} is VALID [2022-02-20 18:51:51,765 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:51,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:51,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242034333] [2022-02-20 18:51:51,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242034333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:51,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:51,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:51,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491904380] [2022-02-20 18:51:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:51,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:51,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:51,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:51,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:51,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:51,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:51,816 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)