./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.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.1.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 a158f4486af48c98a7df56cba98940178e8617d42ff04ad885cda239ab95e10a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:30,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:30,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:30,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:30,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:30,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:30,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:30,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:30,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:30,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:30,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:30,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:30,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:30,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:30,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:30,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:30,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:30,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:30,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:30,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:30,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:30,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:30,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:30,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:30,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:30,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:30,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:30,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:30,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:30,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:30,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:30,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:30,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:30,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:30,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:30,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:30,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:30,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:30,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:30,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:30,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:30,485 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:30,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:30,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:30,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:30,505 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:30,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:30,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:30,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:30,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:30,507 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:30,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:30,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:30,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:30,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:30,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:30,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:30,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:30,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:30,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:30,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:30,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:30,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:30,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:30,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:30,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:30,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:30,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:30,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:30,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:30,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:30,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:30,511 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:30,512 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:30,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:30,512 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 -> a158f4486af48c98a7df56cba98940178e8617d42ff04ad885cda239ab95e10a [2022-02-20 18:50:30,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:30,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:30,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:30,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:30,735 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:30,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:50:30,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd62ba46/531b711540534938ad3f711f9a7ff777/FLAG1d55f75df [2022-02-20 18:50:31,190 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:31,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:50:31,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd62ba46/531b711540534938ad3f711f9a7ff777/FLAG1d55f75df [2022-02-20 18:50:31,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd62ba46/531b711540534938ad3f711f9a7ff777 [2022-02-20 18:50:31,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:31,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:31,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:31,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:31,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:31,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:31" (1/1) ... [2022-02-20 18:50:31,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1199c42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:31, skipping insertion in model container [2022-02-20 18:50:31,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:31" (1/1) ... [2022-02-20 18:50:31,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:31,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:31,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2022-02-20 18:50:31,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2022-02-20 18:50:31,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2022-02-20 18:50:31,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2022-02-20 18:50:31,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2022-02-20 18:50:31,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2022-02-20 18:50:31,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2022-02-20 18:50:31,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:31,889 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:31,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2022-02-20 18:50:31,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2022-02-20 18:50:31,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2022-02-20 18:50:31,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2022-02-20 18:50:31,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2022-02-20 18:50:31,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2022-02-20 18:50:31,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2022-02-20 18:50:31,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:32,001 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:32,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:32 WrapperNode [2022-02-20 18:50:32,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:32,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:32,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:32,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:32,007 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:32" (1/1) ... [2022-02-20 18:50:32,015 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:32" (1/1) ... [2022-02-20 18:50:32,052 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 973 [2022-02-20 18:50:32,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:32,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:32,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:32,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:32,058 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:32" (1/1) ... [2022-02-20 18:50:32,058 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:32" (1/1) ... [2022-02-20 18:50:32,061 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:32" (1/1) ... [2022-02-20 18:50:32,061 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:32" (1/1) ... [2022-02-20 18:50:32,070 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:32" (1/1) ... [2022-02-20 18:50:32,074 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:32" (1/1) ... [2022-02-20 18:50:32,076 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:32" (1/1) ... [2022-02-20 18:50:32,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:32,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:32,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:32,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:32,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:32" (1/1) ... [2022-02-20 18:50:32,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:32,147 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:32,161 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:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:32,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:32,271 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:32,272 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:32,899 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:32,910 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:32,910 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:32,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:32 BoogieIcfgContainer [2022-02-20 18:50:32,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:32,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:32,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:32,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:32,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:31" (1/3) ... [2022-02-20 18:50:32,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129a1b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:32, skipping insertion in model container [2022-02-20 18:50:32,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:32" (2/3) ... [2022-02-20 18:50:32,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129a1b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:32, skipping insertion in model container [2022-02-20 18:50:32,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:32" (3/3) ... [2022-02-20 18:50:32,920 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:50:32,923 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:32,924 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:50:32,961 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:32,966 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:32,966 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:50:32,988 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:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 18:50:32,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:32,997 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:32,998 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:33,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1899747950, now seen corresponding path program 1 times [2022-02-20 18:50:33,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:33,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169117959] [2022-02-20 18:50:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:33,289 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(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {211#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:33,290 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:33,290 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:33,291 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:33,291 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:33,292 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:33,293 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:33,293 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:33,294 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:33,295 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:33,295 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:33,295 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:33,296 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:33,296 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:33,297 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:33,298 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:33,299 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:33,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {213#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {213#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:33,300 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:33,300 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:33,304 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:33,305 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:33,305 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:33,305 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:33,306 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:33,306 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:33,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {210#false} assume !(~r1~0 % 256 >= 3); {210#false} is VALID [2022-02-20 18:50:33,307 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:33,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {210#false} assume ~r1~0 % 256 < 3;main_~check__tmp~16#1 := 1;~__return_1467~0 := main_~check__tmp~16#1;main_~main__c1~0#1 := ~__return_1467~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:33,307 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:33,307 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:33,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {210#false} assume !(0 == ~mode1~0 % 256); {210#false} is VALID [2022-02-20 18:50:33,308 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:33,308 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:33,308 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:33,308 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:33,309 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:33,309 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:33,309 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:33,309 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:33,309 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:33,310 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:33,310 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:33,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {210#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2089~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2089~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:33,310 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:33,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-02-20 18:50:33,312 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:33,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:33,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169117959] [2022-02-20 18:50:33,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169117959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:33,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:33,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:33,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001463631] [2022-02-20 18:50:33,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:33,322 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:33,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:33,325 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:33,367 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:33,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:33,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:33,390 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:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:34,187 INFO L93 Difference]: Finished difference Result 422 states and 704 transitions. [2022-02-20 18:50:34,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:34,188 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:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:34,189 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:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2022-02-20 18:50:34,196 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:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2022-02-20 18:50:34,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 704 transitions. [2022-02-20 18:50:34,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 704 edges. 704 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:34,701 INFO L225 Difference]: With dead ends: 422 [2022-02-20 18:50:34,701 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 18:50:34,703 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:34,705 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 1100 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:34,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1100 Valid, 310 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 18:50:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 234. [2022-02-20 18:50:34,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:34,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 234 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 233 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,793 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 234 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 233 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,794 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 234 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 233 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:34,801 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2022-02-20 18:50:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 330 transitions. [2022-02-20 18:50:34,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:34,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:34,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 233 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2022-02-20 18:50:34,803 INFO L87 Difference]: Start difference. First operand has 234 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 233 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2022-02-20 18:50:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:34,810 INFO L93 Difference]: Finished difference Result 258 states and 330 transitions. [2022-02-20 18:50:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 330 transitions. [2022-02-20 18:50:34,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:34,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:34,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:34,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 233 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 307 transitions. [2022-02-20 18:50:34,818 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 307 transitions. Word has length 46 [2022-02-20 18:50:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:34,819 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 307 transitions. [2022-02-20 18:50:34,819 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:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 307 transitions. [2022-02-20 18:50:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:34,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:34,820 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:34,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:34,821 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:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash -121525429, now seen corresponding path program 1 times [2022-02-20 18:50:34,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:34,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941795946] [2022-02-20 18:50:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:34,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {1540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {1542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:34,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1542#(<= (+ ~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; {1542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:34,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {1542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:34,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {1542#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:34,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {1542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:34,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:34,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {1542#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1542#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:34,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1543#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:34,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {1543#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {1543#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:34,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {1543#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {1544#(<= (+ ~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; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {1544#(<= (+ ~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; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {1544#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1544#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:34,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {1544#(<= (+ ~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; {1541#false} is VALID [2022-02-20 18:50:34,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {1541#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {1541#false} is VALID [2022-02-20 18:50:34,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {1541#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; {1541#false} is VALID [2022-02-20 18:50:34,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {1541#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1541#false} is VALID [2022-02-20 18:50:34,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {1541#false} assume !(~r1~0 % 256 >= 3); {1541#false} is VALID [2022-02-20 18:50:34,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {1541#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1541#false} is VALID [2022-02-20 18:50:34,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {1541#false} assume ~r1~0 % 256 < 3;main_~check__tmp~12#1 := 1;~__return_1963~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_1963~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; {1541#false} is VALID [2022-02-20 18:50:34,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {1541#false} assume !(0 == main_~assert__arg~11#1 % 256); {1541#false} is VALID [2022-02-20 18:50:34,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {1541#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1541#false} is VALID [2022-02-20 18:50:34,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {1541#false} assume !(0 == ~mode1~0 % 256); {1541#false} is VALID [2022-02-20 18:50:34,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {1541#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; {1541#false} is VALID [2022-02-20 18:50:34,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {1541#false} assume main_~node1__m1~1#1 != ~nomsg~0; {1541#false} is VALID [2022-02-20 18:50:34,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {1541#false} assume !(main_~node1__m1~1#1 > ~id1~0); {1541#false} is VALID [2022-02-20 18:50:34,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {1541#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; {1541#false} is VALID [2022-02-20 18:50:34,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {1541#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1541#false} is VALID [2022-02-20 18:50:34,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {1541#false} assume main_~node2__m2~3#1 != ~nomsg~0; {1541#false} is VALID [2022-02-20 18:50:34,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {1541#false} assume !(main_~node2__m2~3#1 > ~id2~0); {1541#false} is VALID [2022-02-20 18:50:34,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {1541#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; {1541#false} is VALID [2022-02-20 18:50:34,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {1541#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1541#false} is VALID [2022-02-20 18:50:34,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {1541#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {1541#false} is VALID [2022-02-20 18:50:34,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {1541#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; {1541#false} is VALID [2022-02-20 18:50:34,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {1541#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2089~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2089~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; {1541#false} is VALID [2022-02-20 18:50:34,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {1541#false} assume 0 == main_~assert__arg~8#1 % 256; {1541#false} is VALID [2022-02-20 18:50:34,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {1541#false} assume !false; {1541#false} is VALID [2022-02-20 18:50:34,916 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:34,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:34,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941795946] [2022-02-20 18:50:34,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941795946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:34,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:34,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:34,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492141347] [2022-02-20 18:50:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:34,918 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:34,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:34,919 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:34,945 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:34,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:34,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:34,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:34,946 INFO L87 Difference]: Start difference. First operand 234 states and 307 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:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:35,389 INFO L93 Difference]: Finished difference Result 417 states and 560 transitions. [2022-02-20 18:50:35,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:35,389 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:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:35,390 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:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-02-20 18:50:35,392 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:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-02-20 18:50:35,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 380 transitions. [2022-02-20 18:50:35,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:35,638 INFO L225 Difference]: With dead ends: 417 [2022-02-20 18:50:35,638 INFO L226 Difference]: Without dead ends: 221 [2022-02-20 18:50:35,639 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:35,640 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 555 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:35,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [555 Valid, 132 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-02-20 18:50:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-02-20 18:50:35,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:35,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 214 states have (on average 1.355140186915888) internal successors, (290), 220 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:35,800 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 214 states have (on average 1.355140186915888) internal successors, (290), 220 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:35,800 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 214 states have (on average 1.355140186915888) internal successors, (290), 220 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:35,806 INFO L93 Difference]: Finished difference Result 221 states and 290 transitions. [2022-02-20 18:50:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 290 transitions. [2022-02-20 18:50:35,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:35,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:35,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 214 states have (on average 1.355140186915888) internal successors, (290), 220 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 221 states. [2022-02-20 18:50:35,808 INFO L87 Difference]: Start difference. First operand has 221 states, 214 states have (on average 1.355140186915888) internal successors, (290), 220 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 221 states. [2022-02-20 18:50:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:35,813 INFO L93 Difference]: Finished difference Result 221 states and 290 transitions. [2022-02-20 18:50:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 290 transitions. [2022-02-20 18:50:35,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:35,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:35,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:35,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 214 states have (on average 1.355140186915888) internal successors, (290), 220 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 290 transitions. [2022-02-20 18:50:35,820 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 290 transitions. Word has length 47 [2022-02-20 18:50:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:35,820 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 290 transitions. [2022-02-20 18:50:35,820 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:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 290 transitions. [2022-02-20 18:50:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:35,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:35,821 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:35,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:35,822 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:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash 414043727, now seen corresponding path program 1 times [2022-02-20 18:50:35,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:35,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009074737] [2022-02-20 18:50:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:35,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:35,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {2796#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {2798#(<= (+ ~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; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {2798#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:35,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {2798#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {2799#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:35,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {2799#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {2799#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:35,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {2799#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {2800#(<= (+ ~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; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {2800#(<= (+ ~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; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {2800#(<= (+ ~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; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {2800#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2800#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:35,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {2800#(<= (+ ~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; {2797#false} is VALID [2022-02-20 18:50:35,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {2797#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2797#false} is VALID [2022-02-20 18:50:35,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {2797#false} assume !(~r1~0 % 256 >= 3); {2797#false} is VALID [2022-02-20 18:50:35,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {2797#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2797#false} is VALID [2022-02-20 18:50:35,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {2797#false} assume ~r1~0 % 256 < 3;main_~check__tmp~10#1 := 1;~__return_2136~0 := main_~check__tmp~10#1;main_~main__c1~0#1 := ~__return_2136~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; {2797#false} is VALID [2022-02-20 18:50:35,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {2797#false} assume !(0 == main_~assert__arg~9#1 % 256); {2797#false} is VALID [2022-02-20 18:50:35,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {2797#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2797#false} is VALID [2022-02-20 18:50:35,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {2797#false} assume !(0 == ~mode1~0 % 256); {2797#false} is VALID [2022-02-20 18:50:35,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {2797#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; {2797#false} is VALID [2022-02-20 18:50:35,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {2797#false} assume main_~node1__m1~1#1 != ~nomsg~0; {2797#false} is VALID [2022-02-20 18:50:35,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !(main_~node1__m1~1#1 > ~id1~0); {2797#false} is VALID [2022-02-20 18:50:35,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {2797#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; {2797#false} is VALID [2022-02-20 18:50:35,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {2797#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2797#false} is VALID [2022-02-20 18:50:35,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {2797#false} assume main_~node2__m2~3#1 != ~nomsg~0; {2797#false} is VALID [2022-02-20 18:50:35,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {2797#false} assume !(main_~node2__m2~3#1 > ~id2~0); {2797#false} is VALID [2022-02-20 18:50:35,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {2797#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; {2797#false} is VALID [2022-02-20 18:50:35,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {2797#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2797#false} is VALID [2022-02-20 18:50:35,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {2797#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {2797#false} is VALID [2022-02-20 18:50:35,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {2797#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; {2797#false} is VALID [2022-02-20 18:50:35,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {2797#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2089~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2089~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; {2797#false} is VALID [2022-02-20 18:50:35,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {2797#false} assume 0 == main_~assert__arg~8#1 % 256; {2797#false} is VALID [2022-02-20 18:50:35,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2022-02-20 18:50:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:35,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:35,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009074737] [2022-02-20 18:50:35,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009074737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:35,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:35,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:35,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674671262] [2022-02-20 18:50:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:35,932 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:35,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:35,935 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:35,961 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:35,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:35,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:35,965 INFO L87 Difference]: Start difference. First operand 221 states and 290 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:36,453 INFO L93 Difference]: Finished difference Result 404 states and 541 transitions. [2022-02-20 18:50:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:36,453 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:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 363 transitions. [2022-02-20 18:50:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 363 transitions. [2022-02-20 18:50:36,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 363 transitions. [2022-02-20 18:50:36,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:36,691 INFO L225 Difference]: With dead ends: 404 [2022-02-20 18:50:36,691 INFO L226 Difference]: Without dead ends: 216 [2022-02-20 18:50:36,692 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:36,693 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 517 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:36,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 129 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-20 18:50:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-02-20 18:50:36,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:36,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 216 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 215 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call 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:36,872 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 216 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 215 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call 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:36,873 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 216 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 215 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call 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:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:36,877 INFO L93 Difference]: Finished difference Result 216 states and 282 transitions. [2022-02-20 18:50:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 282 transitions. [2022-02-20 18:50:36,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:36,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:36,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 215 states have internal predecessors, (282), 0 states have call successors, (0), 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 216 states. [2022-02-20 18:50:36,878 INFO L87 Difference]: Start difference. First operand has 216 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 215 states have internal predecessors, (282), 0 states have call successors, (0), 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 216 states. [2022-02-20 18:50:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:36,883 INFO L93 Difference]: Finished difference Result 216 states and 282 transitions. [2022-02-20 18:50:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 282 transitions. [2022-02-20 18:50:36,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:36,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:36,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:36,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 215 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call 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:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 282 transitions. [2022-02-20 18:50:36,903 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 282 transitions. Word has length 48 [2022-02-20 18:50:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:36,903 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 282 transitions. [2022-02-20 18:50:36,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 282 transitions. [2022-02-20 18:50:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:36,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:36,904 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:50:36,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:36,905 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:50:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash -453133940, now seen corresponding path program 1 times [2022-02-20 18:50:36,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:36,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554216811] [2022-02-20 18:50:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:37,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {4024#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {4026#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:37,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {4026#(<= (+ ~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; {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {4027#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {4028#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {4028#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {4028#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:37,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {4028#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(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; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {4029#(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; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {4029#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:37,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {4029#(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; {4030#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:37,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {4030#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4030#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:37,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {4030#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {4030#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:37,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {4030#(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; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {4031#(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; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {4031#(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; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~3#1 > ~id2~0); {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {4031#(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; {4031#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:37,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {4031#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4032#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} is VALID [2022-02-20 18:50:37,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {4032#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~5#1|))} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {4025#false} is VALID [2022-02-20 18:50:37,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {4025#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; {4025#false} is VALID [2022-02-20 18:50:37,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {4025#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2089~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2089~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; {4025#false} is VALID [2022-02-20 18:50:37,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {4025#false} assume 0 == main_~assert__arg~8#1 % 256; {4025#false} is VALID [2022-02-20 18:50:37,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {4025#false} assume !false; {4025#false} is VALID [2022-02-20 18:50:37,105 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:37,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:37,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554216811] [2022-02-20 18:50:37,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554216811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:37,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:37,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:37,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292023124] [2022-02-20 18:50:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:37,107 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:50:37,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:37,107 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:50:37,140 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:50:37,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:37,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:37,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:37,141 INFO L87 Difference]: Start difference. First operand 216 states and 282 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:50:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:39,201 INFO L93 Difference]: Finished difference Result 531 states and 735 transitions. [2022-02-20 18:50:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:39,201 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:50:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:39,202 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:50:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 438 transitions. [2022-02-20 18:50:39,204 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:50:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 438 transitions. [2022-02-20 18:50:39,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 438 transitions. [2022-02-20 18:50:39,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:39,525 INFO L225 Difference]: With dead ends: 531 [2022-02-20 18:50:39,525 INFO L226 Difference]: Without dead ends: 526 [2022-02-20 18:50:39,526 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:50:39,530 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 1050 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:39,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1050 Valid, 616 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-02-20 18:50:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 216. [2022-02-20 18:50:39,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:39,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 526 states. Second operand has 216 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 215 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:39,806 INFO L74 IsIncluded]: Start isIncluded. First operand 526 states. Second operand has 216 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 215 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:39,806 INFO L87 Difference]: Start difference. First operand 526 states. Second operand has 216 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 215 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:39,820 INFO L93 Difference]: Finished difference Result 526 states and 730 transitions. [2022-02-20 18:50:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 730 transitions. [2022-02-20 18:50:39,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:39,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:39,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 215 states have internal predecessors, (281), 0 states have call successors, (0), 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 526 states. [2022-02-20 18:50:39,826 INFO L87 Difference]: Start difference. First operand has 216 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 215 states have internal predecessors, (281), 0 states have call successors, (0), 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 526 states. [2022-02-20 18:50:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:39,842 INFO L93 Difference]: Finished difference Result 526 states and 730 transitions. [2022-02-20 18:50:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 730 transitions. [2022-02-20 18:50:39,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:39,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:39,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:39,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 215 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 281 transitions. [2022-02-20 18:50:39,848 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 281 transitions. Word has length 49 [2022-02-20 18:50:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:39,848 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 281 transitions. [2022-02-20 18:50:39,848 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:50:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 281 transitions. [2022-02-20 18:50:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:39,849 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:39,849 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:50:39,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:39,849 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:50:39,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1459063162, now seen corresponding path program 1 times [2022-02-20 18:50:39,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:39,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240927779] [2022-02-20 18:50:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:39,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {6091#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {6093#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:39,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {6093#(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; {6094#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {6094#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {6094#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {6094#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {6095#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {6095#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {6095#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {6095#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {6096#(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; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {6096#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:39,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {6096#(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; {6097#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:39,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {6097#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6097#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:39,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {6097#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {6097#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:39,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {6097#(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; {6097#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:39,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {6097#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6097#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:39,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {6097#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {6097#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:39,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {6097#(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; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 3); {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {6098#(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; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {6098#(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; {6098#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:39,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {6098#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6099#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} is VALID [2022-02-20 18:50:39,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {6099#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~3#1|))} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6092#false} is VALID [2022-02-20 18:50:39,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {6092#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L290 TraceCheckUtils]: 42: Hoare triple {6092#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {6092#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {6092#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {6092#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; {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {6092#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1900~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1900~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; {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {6092#false} assume 0 == main_~assert__arg~7#1 % 256; {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-02-20 18:50:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:40,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:40,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240927779] [2022-02-20 18:50:40,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240927779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:40,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:40,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:40,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626281804] [2022-02-20 18:50:40,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:40,001 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:50:40,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:40,002 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:50:40,036 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:50:40,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:40,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:40,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:40,039 INFO L87 Difference]: Start difference. First operand 216 states and 281 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:50:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,336 INFO L93 Difference]: Finished difference Result 535 states and 738 transitions. [2022-02-20 18:50:42,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:42,336 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:50:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:42,336 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:50:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 522 transitions. [2022-02-20 18:50:42,340 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:50:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 522 transitions. [2022-02-20 18:50:42,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 522 transitions. [2022-02-20 18:50:42,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:42,694 INFO L225 Difference]: With dead ends: 535 [2022-02-20 18:50:42,694 INFO L226 Difference]: Without dead ends: 434 [2022-02-20 18:50:42,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:42,695 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 1031 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:42,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1031 Valid, 824 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:50:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-02-20 18:50:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 216. [2022-02-20 18:50:42,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:42,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:42,966 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:42,967 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,979 INFO L93 Difference]: Finished difference Result 434 states and 590 transitions. [2022-02-20 18:50:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 590 transitions. [2022-02-20 18:50:42,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:42,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:42,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 0 states have call successors, (0), 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 434 states. [2022-02-20 18:50:42,981 INFO L87 Difference]: Start difference. First operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 0 states have call successors, (0), 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 434 states. [2022-02-20 18:50:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,992 INFO L93 Difference]: Finished difference Result 434 states and 590 transitions. [2022-02-20 18:50:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 590 transitions. [2022-02-20 18:50:42,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:42,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:42,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:42,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call 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:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 280 transitions. [2022-02-20 18:50:42,997 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 280 transitions. Word has length 49 [2022-02-20 18:50:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:42,997 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 280 transitions. [2022-02-20 18:50:42,998 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:50:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 280 transitions. [2022-02-20 18:50:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:42,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:42,999 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:50:42,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:43,000 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:50:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash 8857914, now seen corresponding path program 1 times [2022-02-20 18:50:43,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:43,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281577819] [2022-02-20 18:50:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:43,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {7975#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {7977#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:43,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {7977#(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; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {7978#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {7979#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {7979#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {7979#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {7979#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {7980#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {7980#(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; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {7980#(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; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {7980#(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; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {7980#(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; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {7980#(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; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {7980#(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; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 != ~nomsg~0; {7980#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:43,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {7980#(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; {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {7981#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {7981#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 3); {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {7981#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {7981#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {7981#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256); {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {7981#(not (= ~p3_old~0 ~nomsg~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {7981#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {7981#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:43,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {7981#(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; {7982#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:50:43,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {7982#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {7976#false} is VALID [2022-02-20 18:50:43,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {7976#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7976#false} is VALID [2022-02-20 18:50:43,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {7976#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7976#false} is VALID [2022-02-20 18:50:43,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {7976#false} assume main_~node2__m2~1#1 != ~nomsg~0; {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {7976#false} assume !(main_~node2__m2~1#1 > ~id2~0); {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {7976#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; {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {7976#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {7976#false} assume main_~node3__m3~3#1 != ~nomsg~0; {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {7976#false} assume !(main_~node3__m3~3#1 > ~id3~0); {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {7976#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; {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {7976#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2169~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2169~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; {7976#false} is VALID [2022-02-20 18:50:43,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {7976#false} assume 0 == main_~assert__arg~5#1 % 256; {7976#false} is VALID [2022-02-20 18:50:43,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {7976#false} assume !false; {7976#false} is VALID [2022-02-20 18:50:43,122 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:43,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:43,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281577819] [2022-02-20 18:50:43,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281577819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:43,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:43,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:50:43,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741679464] [2022-02-20 18:50:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:43,123 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:50:43,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:43,129 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:50:43,175 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:50:43,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:50:43,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:50:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:43,176 INFO L87 Difference]: Start difference. First operand 216 states and 280 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:50:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,395 INFO L93 Difference]: Finished difference Result 460 states and 615 transitions. [2022-02-20 18:50:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:44,396 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:50:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:44,396 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:50:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 394 transitions. [2022-02-20 18:50:44,398 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:50:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 394 transitions. [2022-02-20 18:50:44,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 394 transitions. [2022-02-20 18:50:44,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:44,663 INFO L225 Difference]: With dead ends: 460 [2022-02-20 18:50:44,663 INFO L226 Difference]: Without dead ends: 336 [2022-02-20 18:50:44,664 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:50:44,664 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 1018 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:44,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1018 Valid, 310 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-02-20 18:50:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2022-02-20 18:50:44,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:44,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:44,975 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:44,976 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,981 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2022-02-20 18:50:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 440 transitions. [2022-02-20 18:50:44,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:44,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:44,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:50:44,983 INFO L87 Difference]: Start difference. First operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 0 states have call successors, (0), 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 336 states. [2022-02-20 18:50:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,989 INFO L93 Difference]: Finished difference Result 336 states and 440 transitions. [2022-02-20 18:50:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 440 transitions. [2022-02-20 18:50:44,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:44,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:44,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:44,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2022-02-20 18:50:44,993 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 49 [2022-02-20 18:50:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:44,993 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2022-02-20 18:50:44,993 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:50:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2022-02-20 18:50:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:44,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:44,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:44,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:44,994 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:50:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1308237609, now seen corresponding path program 1 times [2022-02-20 18:50:44,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:44,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921948009] [2022-02-20 18:50:44,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {9540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {9540#true} is VALID [2022-02-20 18:50:45,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {9540#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; {9542#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {9542#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {9542#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:45,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {9542#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {9543#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:45,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {9543#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {9543#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:45,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {9543#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {9544#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:50:45,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {9544#(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; {9544#(and (<= ~send1~0 127) (<= ~id2~0 (+ ~send1~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)))} is VALID [2022-02-20 18:50:45,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {9544#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {9545#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {9545#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {9545#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {9545#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {9545#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {9545#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {9545#(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; {9545#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:45,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {9545#(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; {9546#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:50:45,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {9546#(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; {9546#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:50:45,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {9546#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {9546#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:50:45,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {9546#(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; {9546#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:50:45,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {9546#(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; {9546#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:50:45,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {9546#(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; {9546#(and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 (+ ~id2~0 127)) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))))} is VALID [2022-02-20 18:50:45,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {9546#(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; {9547#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:50:45,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {9547#(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; {9547#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:50:45,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {9547#(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; {9547#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:50:45,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {9547#(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; {9547#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:50:45,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {9547#(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; {9547#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:50:45,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {9547#(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; {9547#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:50:45,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {9547#(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; {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {9548#(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; {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {9548#(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); {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {9548#(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; {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {9548#(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_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {9548#(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); {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {9548#(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; {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {9548#(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); {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {9548#(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; {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {9548#(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; {9548#(or (<= (+ ~id2~0 129) ~p1_old~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {9548#(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; {9549#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {9549#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0; {9549#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {9549#(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; {9549#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:45,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {9549#(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; {9550#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:45,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {9550#(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; {9550#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:45,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {9550#(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); {9551#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:50:45,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {9551#(<= (+ |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; {9541#false} is VALID [2022-02-20 18:50:45,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {9541#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9541#false} is VALID [2022-02-20 18:50:45,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {9541#false} assume main_~node3__m3~3#1 != ~nomsg~0; {9541#false} is VALID [2022-02-20 18:50:45,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {9541#false} assume !(main_~node3__m3~3#1 > ~id3~0); {9541#false} is VALID [2022-02-20 18:50:45,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {9541#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; {9541#false} is VALID [2022-02-20 18:50:45,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {9541#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_2169~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_2169~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; {9541#false} is VALID [2022-02-20 18:50:45,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {9541#false} assume 0 == main_~assert__arg~5#1 % 256; {9541#false} is VALID [2022-02-20 18:50:45,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {9541#false} assume !false; {9541#false} is VALID [2022-02-20 18:50:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:45,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921948009] [2022-02-20 18:50:45,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921948009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:45,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403633711] [2022-02-20 18:50:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:45,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:45,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:45,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:45,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:45,400 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,256 INFO L93 Difference]: Finished difference Result 459 states and 636 transitions. [2022-02-20 18:50:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:50:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 406 transitions. [2022-02-20 18:50:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 406 transitions. [2022-02-20 18:50:48,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 406 transitions. [2022-02-20 18:50:48,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:48,570 INFO L225 Difference]: With dead ends: 459 [2022-02-20 18:50:48,570 INFO L226 Difference]: Without dead ends: 443 [2022-02-20 18:50:48,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:50:48,572 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 1142 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:48,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1142 Valid, 1266 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-02-20 18:50:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 200. [2022-02-20 18:50:49,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:49,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 200 states, 195 states have (on average 1.3333333333333333) internal successors, (260), 199 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,058 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 200 states, 195 states have (on average 1.3333333333333333) internal successors, (260), 199 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,058 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 200 states, 195 states have (on average 1.3333333333333333) internal successors, (260), 199 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,068 INFO L93 Difference]: Finished difference Result 443 states and 617 transitions. [2022-02-20 18:50:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 617 transitions. [2022-02-20 18:50:49,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.3333333333333333) internal successors, (260), 199 states have internal predecessors, (260), 0 states have call successors, (0), 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 443 states. [2022-02-20 18:50:49,069 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.3333333333333333) internal successors, (260), 199 states have internal predecessors, (260), 0 states have call successors, (0), 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 443 states. [2022-02-20 18:50:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,079 INFO L93 Difference]: Finished difference Result 443 states and 617 transitions. [2022-02-20 18:50:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 617 transitions. [2022-02-20 18:50:49,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:49,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.3333333333333333) internal successors, (260), 199 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 260 transitions. [2022-02-20 18:50:49,083 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 260 transitions. Word has length 51 [2022-02-20 18:50:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:49,083 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 260 transitions. [2022-02-20 18:50:49,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 260 transitions. [2022-02-20 18:50:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:49,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:49,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:49,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:49,085 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:50:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 766441193, now seen corresponding path program 1 times [2022-02-20 18:50:49,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:49,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140646503] [2022-02-20 18:50:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:49,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:49,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {11319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {11319#true} is VALID [2022-02-20 18:50:49,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {11319#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; {11321#(<= ~send1~0 127)} is VALID [2022-02-20 18:50:49,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {11321#(<= ~send1~0 127)} assume 0 == ~r1~0 % 256; {11321#(<= ~send1~0 127)} is VALID [2022-02-20 18:50:49,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {11321#(<= ~send1~0 127)} assume ~id1~0 >= 0; {11322#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:50:49,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {11322#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {11322#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:50:49,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {11322#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {11323#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:50:49,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {11323#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {11323#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:50:49,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {11323#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {11324#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:50:49,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {11324#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {11324#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:50:49,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {11324#(and (<= ~id1~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {11325#(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:50:49,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {11325#(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; {11325#(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:50:49,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {11325#(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; {11326#(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:50:49,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {11326#(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; {11326#(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:50:49,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {11326#(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; {11327#(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:50:49,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {11327#(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; {11327#(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:50:49,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {11327#(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; {11327#(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:50:49,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {11327#(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; {11327#(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:50:49,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {11327#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {11327#(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:50:49,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {11327#(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; {11327#(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:50:49,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {11327#(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; {11327#(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:50:49,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {11327#(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; {11327#(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:50:49,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {11327#(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; {11328#(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:50:49,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {11328#(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; {11328#(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:50:49,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {11328#(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; {11328#(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:50:49,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {11328#(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; {11329#(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:50:49,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {11329#(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; {11329#(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:50:49,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {11329#(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; {11329#(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:50:49,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {11329#(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; {11330#(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:50:49,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {11330#(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; {11330#(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:50:49,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {11330#(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); {11330#(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:50:49,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {11330#(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; {11330#(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:50:49,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {11330#(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_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {11330#(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:50:49,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {11330#(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); {11330#(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:50:49,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {11330#(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; {11330#(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:50:49,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {11330#(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); {11330#(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:50:49,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {11330#(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; {11331#(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:50:49,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {11331#(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; {11331#(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:50:49,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {11331#(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); {11332#(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:50:49,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {11332#(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; {11333#(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:50:49,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {11333#(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; {11334#(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:50:49,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {11334#(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; {11334#(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:50:49,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {11334#(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; {11335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:49,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {11335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {11335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:49,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {11335#(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; {11335#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:49,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {11335#(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; {11336#(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:50:49,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {11336#(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; {11336#(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:50:49,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {11336#(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); {11337#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:50:49,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {11337#(<= (+ |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; {11320#false} is VALID [2022-02-20 18:50:49,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {11320#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1900~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1900~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; {11320#false} is VALID [2022-02-20 18:50:49,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {11320#false} assume 0 == main_~assert__arg~7#1 % 256; {11320#false} is VALID [2022-02-20 18:50:49,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {11320#false} assume !false; {11320#false} is VALID [2022-02-20 18:50:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:49,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:49,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140646503] [2022-02-20 18:50:49,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140646503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:49,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:49,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:50:49,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030787659] [2022-02-20 18:50:49,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:49,593 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:50:49,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:49,593 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:50:49,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:50:49,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:50:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:50:49,642 INFO L87 Difference]: Start difference. First operand 200 states and 260 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:50:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,504 INFO L93 Difference]: Finished difference Result 453 states and 619 transitions. [2022-02-20 18:50:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 18:50:54,504 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:50:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:54,504 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:50:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 472 transitions. [2022-02-20 18:50:54,507 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:50:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 472 transitions. [2022-02-20 18:50:54,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 472 transitions. [2022-02-20 18:50:54,854 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:50:54,860 INFO L225 Difference]: With dead ends: 453 [2022-02-20 18:50:54,860 INFO L226 Difference]: Without dead ends: 365 [2022-02-20 18:50:54,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 18:50:54,861 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 1085 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:54,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1085 Valid, 1803 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:50:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-02-20 18:50:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 206. [2022-02-20 18:50:55,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:55,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 206 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 205 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call 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:55,395 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 206 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 205 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call 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:55,396 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 206 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 205 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call 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:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,401 INFO L93 Difference]: Finished difference Result 365 states and 486 transitions. [2022-02-20 18:50:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2022-02-20 18:50:55,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 205 states have internal predecessors, (268), 0 states have call successors, (0), 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 365 states. [2022-02-20 18:50:55,403 INFO L87 Difference]: Start difference. First operand has 206 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 205 states have internal predecessors, (268), 0 states have call successors, (0), 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 365 states. [2022-02-20 18:50:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,408 INFO L93 Difference]: Finished difference Result 365 states and 486 transitions. [2022-02-20 18:50:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2022-02-20 18:50:55,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:55,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.3333333333333333) internal successors, (268), 205 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call 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:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-02-20 18:50:55,412 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 51 [2022-02-20 18:50:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:55,412 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-02-20 18:50:55,412 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:50:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-02-20 18:50:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:55,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:55,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:55,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:55,414 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:50:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:55,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1014075955, now seen corresponding path program 1 times [2022-02-20 18:50:55,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:55,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303480336] [2022-02-20 18:50:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:55,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {12964#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {12964#true} is VALID [2022-02-20 18:50:55,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {12964#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; {12966#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:55,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {12966#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {12966#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:55,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {12966#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {12967#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:55,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {12967#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {12967#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:55,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {12967#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {12968#(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:50:55,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {12968#(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; {12968#(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:50:55,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {12968#(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; {12969#(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:50:55,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {12969#(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; {12969#(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:50:55,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {12969#(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; {12969#(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:50:55,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {12969#(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; {12969#(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:50:55,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {12969#(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; {12969#(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:50:55,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {12969#(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; {12969#(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:50:55,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {12969#(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; {12969#(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:50:55,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {12969#(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; {12969#(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:50:55,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {12969#(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; {12970#(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:50:55,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {12970#(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; {12970#(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:50:55,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {12970#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {12970#(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:50:55,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {12970#(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; {12970#(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:50:55,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {12970#(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; {12970#(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:50:55,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {12970#(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; {12970#(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:50:55,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {12970#(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; {12971#(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:50:55,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {12971#(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; {12971#(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:50:55,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {12971#(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; {12971#(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:50:55,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {12971#(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; {12971#(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:50:55,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {12971#(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; {12971#(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:50:55,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {12971#(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; {12971#(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:50:55,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {12971#(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; {12972#(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:50:55,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {12972#(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; {12972#(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:50:55,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {12972#(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); {12972#(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:50:55,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {12972#(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; {12972#(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:50:55,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {12972#(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_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {12972#(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:50:55,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {12972#(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); {12972#(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:50:55,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {12972#(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; {12972#(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:50:55,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {12972#(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); {12972#(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:50:55,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {12972#(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; {12972#(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:50:55,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {12972#(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; {12972#(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:50:55,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {12972#(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); {12972#(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:50:55,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {12972#(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; {12973#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:55,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {12973#(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; {12974#(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:50:55,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {12974#(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; {12974#(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:50:55,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {12974#(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); {12975#(<= (+ |ULTIMATE.start_main_~node2__m2~3#1| 1) ~id2~0)} is VALID [2022-02-20 18:50:55,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {12975#(<= (+ |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; {12965#false} is VALID [2022-02-20 18:50:55,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {12965#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12965#false} is VALID [2022-02-20 18:50:55,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {12965#false} assume main_~node3__m3~5#1 != ~nomsg~0; {12965#false} is VALID [2022-02-20 18:50:55,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {12965#false} assume main_~node3__m3~5#1 > ~id3~0;~send3~0 := main_~node3__m3~5#1; {12965#false} is VALID [2022-02-20 18:50:55,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {12965#false} ~mode3~0 := 0; {12965#false} is VALID [2022-02-20 18:50:55,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {12965#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; {12965#false} is VALID [2022-02-20 18:50:55,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {12965#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_2089~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_2089~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; {12965#false} is VALID [2022-02-20 18:50:55,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {12965#false} assume 0 == main_~assert__arg~8#1 % 256; {12965#false} is VALID [2022-02-20 18:50:55,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {12965#false} assume !false; {12965#false} is VALID [2022-02-20 18:50:55,732 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:55,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:55,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303480336] [2022-02-20 18:50:55,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303480336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:55,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:55,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:55,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869666978] [2022-02-20 18:50:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:55,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:55,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:55,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:55,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:55,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:55,784 INFO L87 Difference]: Start difference. First operand 206 states and 268 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,675 INFO L93 Difference]: Finished difference Result 425 states and 595 transitions. [2022-02-20 18:50:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:50:58,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:58,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 382 transitions. [2022-02-20 18:50:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 382 transitions. [2022-02-20 18:50:58,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 382 transitions. [2022-02-20 18:50:58,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 382 edges. 382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:58,957 INFO L225 Difference]: With dead ends: 425 [2022-02-20 18:50:58,957 INFO L226 Difference]: Without dead ends: 330 [2022-02-20 18:50:58,957 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:50:58,958 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 942 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:58,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 1128 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-20 18:50:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 195. [2022-02-20 18:50:59,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:59,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 195 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 194 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call 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,510 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 195 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 194 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call 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,511 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 195 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 194 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call 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,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,515 INFO L93 Difference]: Finished difference Result 330 states and 454 transitions. [2022-02-20 18:50:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 454 transitions. [2022-02-20 18:50:59,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 194 states have internal predecessors, (255), 0 states have call successors, (0), 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:50:59,516 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 194 states have internal predecessors, (255), 0 states have call successors, (0), 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:50:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,520 INFO L93 Difference]: Finished difference Result 330 states and 454 transitions. [2022-02-20 18:50:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 454 transitions. [2022-02-20 18:50:59,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:59,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.3350785340314135) internal successors, (255), 194 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call 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,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2022-02-20 18:50:59,524 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 51 [2022-02-20 18:50:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:59,524 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2022-02-20 18:50:59,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2022-02-20 18:50:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:59,525 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:59,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:59,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:50:59,525 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:50:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1721906586, now seen corresponding path program 1 times [2022-02-20 18:50:59,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:59,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2704835] [2022-02-20 18:50:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:59,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {14474#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {14476#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:59,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {14476#(<= (+ ~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; {14477#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {14477#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {14477#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {14477#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {14478#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {14478#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {14478#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {14478#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {14479#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {14479#(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; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {14479#(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; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {14479#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) ~send1~0) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:59,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {14479#(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; {14480#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:59,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {14480#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14480#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:59,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {14480#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {14480#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:59,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {14480#(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; {14480#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:59,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {14480#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14480#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:59,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {14480#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {14480#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:59,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {14480#(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; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 3); {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {14481#(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; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14481#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:59,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {14481#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14482#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:59,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {14482#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {14475#false} is VALID [2022-02-20 18:50:59,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {14475#false} havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14475#false} is VALID [2022-02-20 18:50:59,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {14475#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14475#false} is VALID [2022-02-20 18:50:59,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {14475#false} assume main_~node3__m3~1#1 != ~nomsg~0; {14475#false} is VALID [2022-02-20 18:50:59,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {14475#false} assume !(main_~node3__m3~1#1 > ~id3~0); {14475#false} is VALID [2022-02-20 18:50:59,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {14475#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; {14475#false} is VALID [2022-02-20 18:50:59,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {14475#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14475#false} is VALID [2022-02-20 18:50:59,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {14475#false} assume !(~r1~0 % 256 >= 3); {14475#false} is VALID [2022-02-20 18:50:59,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {14475#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1834~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1834~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; {14475#false} is VALID [2022-02-20 18:50:59,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {14475#false} assume 0 == main_~assert__arg~3#1 % 256; {14475#false} is VALID [2022-02-20 18:50:59,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {14475#false} assume !false; {14475#false} is VALID [2022-02-20 18:50:59,640 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,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:59,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2704835] [2022-02-20 18:50:59,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2704835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:59,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:59,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:59,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443999939] [2022-02-20 18:50:59,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:59,641 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:50:59,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:59,641 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:50:59,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:59,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:59,678 INFO L87 Difference]: Start difference. First operand 195 states and 255 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:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,653 INFO L93 Difference]: Finished difference Result 443 states and 617 transitions. [2022-02-20 18:51:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:01,653 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:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:01,653 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:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 379 transitions. [2022-02-20 18:51:01,655 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:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 379 transitions. [2022-02-20 18:51:01,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 379 transitions. [2022-02-20 18:51:01,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:01,913 INFO L225 Difference]: With dead ends: 443 [2022-02-20 18:51:01,913 INFO L226 Difference]: Without dead ends: 329 [2022-02-20 18:51:01,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:01,914 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 686 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:01,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [686 Valid, 490 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-02-20 18:51:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 195. [2022-02-20 18:51:02,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:02,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 195 states, 191 states have (on average 1.324607329842932) internal successors, (253), 194 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,447 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 195 states, 191 states have (on average 1.324607329842932) internal successors, (253), 194 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,447 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 195 states, 191 states have (on average 1.324607329842932) internal successors, (253), 194 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,451 INFO L93 Difference]: Finished difference Result 329 states and 452 transitions. [2022-02-20 18:51:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 452 transitions. [2022-02-20 18:51:02,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:02,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:02,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.324607329842932) internal successors, (253), 194 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 329 states. [2022-02-20 18:51:02,452 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.324607329842932) internal successors, (253), 194 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 329 states. [2022-02-20 18:51:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,457 INFO L93 Difference]: Finished difference Result 329 states and 452 transitions. [2022-02-20 18:51:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 452 transitions. [2022-02-20 18:51:02,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:02,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:02,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:02,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.324607329842932) internal successors, (253), 194 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2022-02-20 18:51:02,460 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 52 [2022-02-20 18:51:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:02,461 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2022-02-20 18:51:02,461 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:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2022-02-20 18:51:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:02,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:02,461 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:02,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:02,462 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:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1294616090, now seen corresponding path program 1 times [2022-02-20 18:51:02,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:02,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073157256] [2022-02-20 18:51:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:02,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {16005#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {16007#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:02,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {16007#(<= (+ ~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; {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {16008#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {16009#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {16009#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {16009#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:02,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {16009#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {16010#(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; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {16010#(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; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {16010#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {16010#(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; {16011#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:02,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {16011#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16011#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:02,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {16011#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {16011#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:02,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {16011#(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; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256); {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {16012#(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; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {16012#(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; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 != ~nomsg~0; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~3#1 > ~id2~0;~send2~0 := main_~node2__m2~3#1; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {16012#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {16012#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16013#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {16013#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~4#1|))} assume !(main_~node3__m3~4#1 != ~nomsg~0);~mode3~0 := 0; {16006#false} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {16006#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; {16006#false} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {16006#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16006#false} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {16006#false} assume !(~r1~0 % 256 >= 3); {16006#false} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {16006#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1751~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1751~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; {16006#false} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {16006#false} assume 0 == main_~assert__arg~6#1 % 256; {16006#false} is VALID [2022-02-20 18:51:02,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {16006#false} assume !false; {16006#false} is VALID [2022-02-20 18:51:02,603 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,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:02,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073157256] [2022-02-20 18:51:02,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073157256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:02,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:02,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:02,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10638547] [2022-02-20 18:51:02,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:02,604 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:02,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:02,604 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:02,635 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:02,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:02,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:02,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:02,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:02,635 INFO L87 Difference]: Start difference. First operand 195 states and 253 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:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,161 INFO L93 Difference]: Finished difference Result 502 states and 695 transitions. [2022-02-20 18:51:05,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:05,161 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:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:05,161 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:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 400 transitions. [2022-02-20 18:51:05,164 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:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 400 transitions. [2022-02-20 18:51:05,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 400 transitions. [2022-02-20 18:51:05,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,439 INFO L225 Difference]: With dead ends: 502 [2022-02-20 18:51:05,439 INFO L226 Difference]: Without dead ends: 495 [2022-02-20 18:51:05,439 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:05,440 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 630 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:05,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 512 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-02-20 18:51:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 195. [2022-02-20 18:51:05,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:05,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 195 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 194 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call 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,975 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 195 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 194 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call 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,975 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 195 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 194 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call 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,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,985 INFO L93 Difference]: Finished difference Result 495 states and 687 transitions. [2022-02-20 18:51:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 687 transitions. [2022-02-20 18:51:05,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 194 states have internal predecessors, (251), 0 states have call successors, (0), 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 495 states. [2022-02-20 18:51:05,986 INFO L87 Difference]: Start difference. First operand has 195 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 194 states have internal predecessors, (251), 0 states have call successors, (0), 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 495 states. [2022-02-20 18:51:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,995 INFO L93 Difference]: Finished difference Result 495 states and 687 transitions. [2022-02-20 18:51:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 687 transitions. [2022-02-20 18:51:05,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:05,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:05,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:05,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 194 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call 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,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 251 transitions. [2022-02-20 18:51:05,998 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 251 transitions. Word has length 52 [2022-02-20 18:51:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:05,998 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 251 transitions. [2022-02-20 18:51:05,998 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:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 251 transitions. [2022-02-20 18:51:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:51:05,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:05,999 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:05,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:05,999 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:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1671010270, now seen corresponding path program 1 times [2022-02-20 18:51:05,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:05,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455512413] [2022-02-20 18:51:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:06,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {17954#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {17954#true} is VALID [2022-02-20 18:51:06,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {17954#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; {17956#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:06,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {17956#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume 0 == ~r1~0 % 256; {17956#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:06,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {17956#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume ~id1~0 >= 0; {17957#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:06,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {17957#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume 0 == ~st1~0; {17957#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} is VALID [2022-02-20 18:51:06,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {17957#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254))} assume ~send1~0 == ~id1~0; {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:06,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:06,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:06,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume 0 == ~st2~0; {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:06,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {17958#(and (<= ~send1~0 127) (<= ~id3~0 127) (<= (+ ~send1~0 ~id2~0) 254) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {17959#(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:06,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {17959#(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; {17959#(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:06,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {17959#(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; {17960#(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:06,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {17960#(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; {17960#(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:06,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {17960#(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; {17960#(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:06,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {17960#(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; {17960#(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:06,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {17960#(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; {17960#(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:06,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {17960#(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; {17960#(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:06,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {17960#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {17961#(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:06,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {17961#(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; {17961#(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:06,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {17961#(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; {17961#(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:06,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {17961#(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; {17961#(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:06,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {17961#(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; {17962#(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:06,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {17962#(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; {17962#(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:06,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {17962#(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; {17962#(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:06,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {17962#(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; {17963#(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:06,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {17963#(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; {17963#(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:06,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {17963#(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; {17963#(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:06,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {17963#(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; {17964#(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:06,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {17964#(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; {17964#(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:06,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {17964#(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); {17964#(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:06,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {17964#(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; {17964#(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:06,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {17964#(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_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {17964#(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:06,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {17964#(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); {17964#(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:06,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {17964#(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; {17964#(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:06,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {17964#(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); {17964#(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:06,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {17964#(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; {17964#(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:06,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {17964#(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; {17964#(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:06,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {17964#(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); {17964#(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:06,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {17964#(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; {17964#(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:06,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {17964#(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; {17965#(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:06,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {17965#(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; {17965#(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:06,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {17965#(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); {17966#(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:06,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {17966#(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); {17967#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {17967#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {17967#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {17967#(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; {17967#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {17967#(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; {17968#(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:06,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {17968#(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; {17968#(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:06,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {17968#(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); {17969#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:06,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {17969#(<= (+ |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; {17955#false} is VALID [2022-02-20 18:51:06,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {17955#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_1900~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_1900~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; {17955#false} is VALID [2022-02-20 18:51:06,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {17955#false} assume 0 == main_~assert__arg~7#1 % 256; {17955#false} is VALID [2022-02-20 18:51:06,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {17955#false} assume !false; {17955#false} is VALID [2022-02-20 18:51:06,539 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,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:06,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455512413] [2022-02-20 18:51:06,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455512413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:06,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:06,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-20 18:51:06,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835307660] [2022-02-20 18:51:06,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:06,540 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:06,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:06,540 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:06,580 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:06,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 18:51:06,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:06,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 18:51:06,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:51:06,580 INFO L87 Difference]: Start difference. First operand 195 states and 251 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:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,167 INFO L93 Difference]: Finished difference Result 295 states and 393 transitions. [2022-02-20 18:51:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 18:51:09,167 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:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:09,167 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:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 244 transitions. [2022-02-20 18:51:09,168 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:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 244 transitions. [2022-02-20 18:51:09,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 244 transitions. [2022-02-20 18:51:09,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,323 INFO L225 Difference]: With dead ends: 295 [2022-02-20 18:51:09,323 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 18:51:09,323 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:09,324 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 253 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:09,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1158 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 18:51:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 185. [2022-02-20 18:51:09,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:09,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 185 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:09,923 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 185 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:09,923 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 185 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,926 INFO L93 Difference]: Finished difference Result 207 states and 260 transitions. [2022-02-20 18:51:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 260 transitions. [2022-02-20 18:51:09,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:09,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:09,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 0 states have call successors, (0), 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 207 states. [2022-02-20 18:51:09,926 INFO L87 Difference]: Start difference. First operand has 185 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 0 states have call successors, (0), 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 207 states. [2022-02-20 18:51:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,928 INFO L93 Difference]: Finished difference Result 207 states and 260 transitions. [2022-02-20 18:51:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 260 transitions. [2022-02-20 18:51:09,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:09,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:09,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:09,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call 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:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 239 transitions. [2022-02-20 18:51:09,931 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 239 transitions. Word has length 52 [2022-02-20 18:51:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:09,931 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 239 transitions. [2022-02-20 18:51:09,931 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:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 239 transitions. [2022-02-20 18:51:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:09,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:09,932 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:09,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:09,932 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:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1899159370, now seen corresponding path program 1 times [2022-02-20 18:51:09,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:09,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393845962] [2022-02-20 18:51:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:09,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:10,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {19035#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {19035#true} is VALID [2022-02-20 18:51:10,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {19035#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; {19037#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:10,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {19037#(<= ~id3~0 127)} assume 0 == ~r1~0 % 256; {19037#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:10,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {19037#(<= ~id3~0 127)} assume ~id1~0 >= 0; {19038#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:10,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {19038#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {19038#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:10,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {19038#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {19039#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:10,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {19039#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {19039#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:10,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {19039#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {19040#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:10,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {19040#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {19040#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:10,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {19040#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {19041#(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:10,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {19041#(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; {19041#(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:10,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {19041#(and (<= ~id3~0 (+ ~send2~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {19042#(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:10,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {19042#(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; {19042#(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:10,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {19042#(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; {19043#(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:10,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {19043#(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; {19043#(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:10,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {19043#(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; {19043#(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:10,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {19043#(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; {19043#(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:10,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {19043#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {19043#(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:10,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {19043#(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; {19043#(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:10,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {19043#(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; {19043#(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:10,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {19043#(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; {19043#(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:10,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {19043#(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; {19044#(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:10,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {19044#(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; {19044#(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:10,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {19044#(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; {19044#(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:10,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {19044#(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; {19045#(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:10,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {19045#(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; {19045#(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:10,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {19045#(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; {19045#(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:10,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {19045#(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; {19046#(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:10,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {19046#(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; {19046#(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:10,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {19046#(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); {19046#(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:10,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {19046#(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; {19046#(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:10,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {19046#(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_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {19046#(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:10,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {19046#(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); {19046#(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:10,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {19046#(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; {19046#(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:10,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {19046#(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); {19046#(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:10,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {19046#(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; {19047#(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:10,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {19047#(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; {19047#(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:10,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {19047#(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; {19048#(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:10,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {19048#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {19048#(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:10,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {19048#(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; {19048#(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:10,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {19048#(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; {19049#(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:10,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {19049#(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; {19049#(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:10,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {19049#(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; {19050#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:10,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {19050#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {19050#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:10,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {19050#(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; {19050#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:10,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {19050#(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; {19051#(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:10,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {19051#(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; {19051#(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:10,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {19051#(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); {19052#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:10,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {19052#(<= (+ |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; {19036#false} is VALID [2022-02-20 18:51:10,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {19036#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19036#false} is VALID [2022-02-20 18:51:10,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {19036#false} assume !(~r1~0 % 256 >= 3); {19036#false} is VALID [2022-02-20 18:51:10,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {19036#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1834~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1834~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; {19036#false} is VALID [2022-02-20 18:51:10,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {19036#false} assume 0 == main_~assert__arg~3#1 % 256; {19036#false} is VALID [2022-02-20 18:51:10,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {19036#false} assume !false; {19036#false} is VALID [2022-02-20 18:51:10,345 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:10,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:10,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393845962] [2022-02-20 18:51:10,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393845962] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:10,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:10,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:10,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985153936] [2022-02-20 18:51:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:10,346 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:10,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:10,347 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:10,389 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:10,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:10,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:10,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:10,389 INFO L87 Difference]: Start difference. First operand 185 states and 239 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:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:14,358 INFO L93 Difference]: Finished difference Result 401 states and 544 transitions. [2022-02-20 18:51:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 18:51:14,358 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:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:14,358 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:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 342 transitions. [2022-02-20 18:51:14,359 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:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 342 transitions. [2022-02-20 18:51:14,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 342 transitions. [2022-02-20 18:51:14,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:14,609 INFO L225 Difference]: With dead ends: 401 [2022-02-20 18:51:14,609 INFO L226 Difference]: Without dead ends: 395 [2022-02-20 18:51:14,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 18:51:14,610 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 557 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:14,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 1858 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:51:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-02-20 18:51:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 191. [2022-02-20 18:51:15,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:15,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 191 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 190 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,246 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 191 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 190 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,247 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 191 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 190 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:15,253 INFO L93 Difference]: Finished difference Result 395 states and 538 transitions. [2022-02-20 18:51:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 538 transitions. [2022-02-20 18:51:15,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:15,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:15,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 190 states have internal predecessors, (247), 0 states have call successors, (0), 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 395 states. [2022-02-20 18:51:15,254 INFO L87 Difference]: Start difference. First operand has 191 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 190 states have internal predecessors, (247), 0 states have call successors, (0), 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 395 states. [2022-02-20 18:51:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:15,261 INFO L93 Difference]: Finished difference Result 395 states and 538 transitions. [2022-02-20 18:51:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 538 transitions. [2022-02-20 18:51:15,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:15,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:15,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:15,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 190 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2022-02-20 18:51:15,264 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 54 [2022-02-20 18:51:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:15,264 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2022-02-20 18:51:15,265 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:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2022-02-20 18:51:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:15,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:15,265 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:15,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:15,265 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:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1464456906, now seen corresponding path program 1 times [2022-02-20 18:51:15,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:15,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955627494] [2022-02-20 18:51:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:15,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:15,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {20651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {20651#true} is VALID [2022-02-20 18:51:15,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {20651#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; {20653#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:15,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {20653#(<= ~send1~0 127)} assume 0 == ~r1~0 % 256; {20653#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:15,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {20653#(<= ~send1~0 127)} assume ~id1~0 >= 0; {20654#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:15,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {20654#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {20654#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:15,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {20654#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {20655#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:15,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {20655#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {20655#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:15,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {20655#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {20656#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:15,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {20656#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {20656#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:15,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {20656#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {20657#(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:15,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {20657#(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; {20657#(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:15,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {20657#(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; {20658#(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:15,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {20658#(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; {20658#(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:15,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {20658#(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; {20659#(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:15,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {20659#(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; {20659#(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:15,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {20659#(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; {20659#(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:15,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {20659#(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; {20659#(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:15,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {20659#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {20659#(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:15,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {20659#(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; {20659#(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:15,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {20659#(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; {20659#(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:15,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {20659#(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; {20659#(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:15,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {20659#(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; {20660#(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:15,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {20660#(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; {20660#(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:15,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {20660#(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; {20660#(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:15,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {20660#(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; {20661#(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:15,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {20661#(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; {20661#(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:15,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {20661#(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; {20661#(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:15,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {20661#(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; {20662#(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:15,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {20662#(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; {20662#(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:15,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {20662#(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); {20662#(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:15,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {20662#(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; {20662#(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:15,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {20662#(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_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {20662#(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:15,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {20662#(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); {20662#(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:15,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {20662#(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; {20662#(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:15,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {20662#(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); {20662#(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:15,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {20662#(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; {20663#(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:15,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {20663#(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; {20663#(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:15,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {20663#(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); {20664#(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:15,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {20664#(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; {20665#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:15,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {20665#(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; {20666#(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:15,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {20666#(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; {20666#(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:15,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {20666#(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; {20667#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:15,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {20667#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0; {20667#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:15,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {20667#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {20667#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:15,701 INFO L290 TraceCheckUtils]: 44: Hoare triple {20667#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20668#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:15,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {20668#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {20668#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:15,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {20668#(<= (+ |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; {20652#false} is VALID [2022-02-20 18:51:15,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {20652#false} ~mode3~0 := 0; {20652#false} is VALID [2022-02-20 18:51:15,702 INFO L290 TraceCheckUtils]: 48: Hoare triple {20652#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; {20652#false} is VALID [2022-02-20 18:51:15,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {20652#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20652#false} is VALID [2022-02-20 18:51:15,702 INFO L290 TraceCheckUtils]: 50: Hoare triple {20652#false} assume !(~r1~0 % 256 >= 3); {20652#false} is VALID [2022-02-20 18:51:15,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {20652#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~6#1 := 0;~__return_1751~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_1751~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; {20652#false} is VALID [2022-02-20 18:51:15,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {20652#false} assume 0 == main_~assert__arg~6#1 % 256; {20652#false} is VALID [2022-02-20 18:51:15,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {20652#false} assume !false; {20652#false} is VALID [2022-02-20 18:51:15,703 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:15,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:15,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955627494] [2022-02-20 18:51:15,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955627494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:15,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:15,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 18:51:15,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446312259] [2022-02-20 18:51:15,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:15,704 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:15,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:15,705 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:15,746 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:15,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:51:15,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:15,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:51:15,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:51:15,747 INFO L87 Difference]: Start difference. First operand 191 states and 247 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:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:18,619 INFO L93 Difference]: Finished difference Result 221 states and 275 transitions. [2022-02-20 18:51:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 18:51:18,619 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:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:18,619 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:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 184 transitions. [2022-02-20 18:51:18,620 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:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 184 transitions. [2022-02-20 18:51:18,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 184 transitions. [2022-02-20 18:51:18,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:18,744 INFO L225 Difference]: With dead ends: 221 [2022-02-20 18:51:18,744 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 18:51:18,744 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:18,744 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 254 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:18,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 1473 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 18:51:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2022-02-20 18:51:19,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:19,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 196 states, 193 states have (on average 1.305699481865285) internal successors, (252), 195 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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,396 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 196 states, 193 states have (on average 1.305699481865285) internal successors, (252), 195 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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,396 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 196 states, 193 states have (on average 1.305699481865285) internal successors, (252), 195 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:19,399 INFO L93 Difference]: Finished difference Result 213 states and 267 transitions. [2022-02-20 18:51:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 267 transitions. [2022-02-20 18:51:19,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:19,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:19,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 193 states have (on average 1.305699481865285) internal successors, (252), 195 states have internal predecessors, (252), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:51:19,399 INFO L87 Difference]: Start difference. First operand has 196 states, 193 states have (on average 1.305699481865285) internal successors, (252), 195 states have internal predecessors, (252), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:51:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:19,401 INFO L93 Difference]: Finished difference Result 213 states and 267 transitions. [2022-02-20 18:51:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 267 transitions. [2022-02-20 18:51:19,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:19,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:19,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:19,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 193 states have (on average 1.305699481865285) internal successors, (252), 195 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 252 transitions. [2022-02-20 18:51:19,404 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 252 transitions. Word has length 54 [2022-02-20 18:51:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:19,404 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 252 transitions. [2022-02-20 18:51:19,405 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:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2022-02-20 18:51:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:19,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:19,405 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:19,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 18:51:19,406 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:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2098262835, now seen corresponding path program 1 times [2022-02-20 18:51:19,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:19,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705992157] [2022-02-20 18:51:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:20,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {21656#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {21656#true} is VALID [2022-02-20 18:51:20,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {21656#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; {21658#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {21658#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {21658#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:20,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {21658#(and (<= ~id1~0 127) (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {21659#(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:20,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {21659#(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; {21659#(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:20,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {21659#(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; {21660#(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:20,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {21660#(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; {21660#(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:20,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {21660#(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; {21660#(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:20,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {21660#(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; {21660#(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:20,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {21660#(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; {21661#(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:20,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {21661#(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; {21661#(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:20,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {21661#(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; {21662#(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:20,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {21662#(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; {21662#(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:20,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {21662#(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; {21663#(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:20,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {21663#(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; {21663#(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:20,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {21663#(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; {21663#(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:20,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {21663#(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; {21663#(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:20,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {21663#(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_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {21664#(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:20,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {21664#(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; {21664#(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:20,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {21664#(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; {21664#(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:20,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {21664#(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; {21664#(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:20,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {21664#(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; {21665#(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:20,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {21665#(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; {21665#(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:20,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {21665#(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; {21665#(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:20,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {21665#(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; {21666#(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:20,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {21666#(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; {21666#(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:20,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {21666#(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; {21666#(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:20,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {21666#(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; {21667#(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:20,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {21667#(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; {21667#(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:20,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {21667#(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); {21667#(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:20,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {21667#(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; {21667#(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:20,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {21667#(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_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {21667#(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:20,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {21667#(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); {21667#(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:20,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {21667#(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; {21667#(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:20,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {21667#(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); {21667#(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:20,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {21667#(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; {21668#(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:20,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {21668#(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; {21668#(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:20,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {21668#(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; {21669#(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:20,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {21669#(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; {21669#(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:20,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {21669#(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; {21669#(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:20,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {21669#(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; {21670#(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:20,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {21670#(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; {21670#(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:20,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {21670#(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); {21671#(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:20,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {21671#(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); {21672#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:20,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {21672#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {21672#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:20,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {21672#(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; {21672#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:20,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {21672#(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; {21673#(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:20,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {21673#(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; {21673#(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:20,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {21673#(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); {21674#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:20,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {21674#(<= (+ |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; {21657#false} is VALID [2022-02-20 18:51:20,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {21657#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21657#false} is VALID [2022-02-20 18:51:20,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {21657#false} assume !(~r1~0 % 256 >= 3); {21657#false} is VALID [2022-02-20 18:51:20,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {21657#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1834~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1834~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; {21657#false} is VALID [2022-02-20 18:51:20,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {21657#false} assume 0 == main_~assert__arg~3#1 % 256; {21657#false} is VALID [2022-02-20 18:51:20,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {21657#false} assume !false; {21657#false} is VALID [2022-02-20 18:51:20,220 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:20,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:20,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705992157] [2022-02-20 18:51:20,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705992157] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:20,221 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:20,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:20,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139308034] [2022-02-20 18:51:20,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:20,222 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:20,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:20,222 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:20,274 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:20,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:20,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:20,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:20,275 INFO L87 Difference]: Start difference. First operand 196 states and 252 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) [2022-02-20 18:51:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,529 INFO L93 Difference]: Finished difference Result 406 states and 547 transitions. [2022-02-20 18:51:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:51:26,529 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:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:51:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 340 transitions. [2022-02-20 18:51:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:51:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 340 transitions. [2022-02-20 18:51:26,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 340 transitions. [2022-02-20 18:51:26,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:26,777 INFO L225 Difference]: With dead ends: 406 [2022-02-20 18:51:26,777 INFO L226 Difference]: Without dead ends: 400 [2022-02-20 18:51:26,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 18:51:26,778 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 656 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:26,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 2833 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 18:51:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-02-20 18:51:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 190. [2022-02-20 18:51:27,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:27,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 190 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call 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,489 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 190 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call 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,489 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 190 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call 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,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:27,495 INFO L93 Difference]: Finished difference Result 400 states and 541 transitions. [2022-02-20 18:51:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 541 transitions. [2022-02-20 18:51:27,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:27,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:27,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 0 states have call successors, (0), 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 400 states. [2022-02-20 18:51:27,496 INFO L87 Difference]: Start difference. First operand has 190 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 0 states have call successors, (0), 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 400 states. [2022-02-20 18:51:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:27,502 INFO L93 Difference]: Finished difference Result 400 states and 541 transitions. [2022-02-20 18:51:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 541 transitions. [2022-02-20 18:51:27,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:27,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:27,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:27,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call 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,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2022-02-20 18:51:27,505 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 55 [2022-02-20 18:51:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:27,506 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2022-02-20 18:51:27,506 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 18:51:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2022-02-20 18:51:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:27,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:27,506 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:27,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 18:51:27,507 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1345030097, now seen corresponding path program 1 times [2022-02-20 18:51:27,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:27,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568236136] [2022-02-20 18:51:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:27,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {23290#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_2202~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1834~0 := 0;~__return_2011~0 := 0;~__return_2169~0 := 0;~__return_1751~0 := 0;~__return_1900~0 := 0;~__return_2089~0 := 0;~__return_2235~0 := 0;~__return_2136~0 := 0;~__return_2044~0 := 0;~__return_1963~0 := 0;~__return_1867~0 := 0;~__return_1798~0 := 0;~__return_1690~0 := 0;~__return_1467~0 := 0; {23290#true} is VALID [2022-02-20 18:51:27,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {23290#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; {23290#true} is VALID [2022-02-20 18:51:27,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {23290#true} assume 0 == ~r1~0 % 256; {23290#true} is VALID [2022-02-20 18:51:27,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {23290#true} assume ~id1~0 >= 0; {23290#true} is VALID [2022-02-20 18:51:27,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {23290#true} assume 0 == ~st1~0; {23290#true} is VALID [2022-02-20 18:51:27,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {23290#true} assume ~send1~0 == ~id1~0; {23290#true} is VALID [2022-02-20 18:51:27,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {23290#true} assume 0 == ~mode1~0 % 256; {23290#true} is VALID [2022-02-20 18:51:27,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {23290#true} assume ~id2~0 >= 0; {23292#(<= 0 ~id2~0)} is VALID [2022-02-20 18:51:27,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {23292#(<= 0 ~id2~0)} assume 0 == ~st2~0; {23292#(<= 0 ~id2~0)} is VALID [2022-02-20 18:51:27,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {23292#(<= 0 ~id2~0)} assume ~send2~0 == ~id2~0; {23293#(and (<= 0 ~send2~0) (or (<= ~id2~0 ~id3~0) (and (<= ~send2~0 ~id2~0) (<= ~id2~0 ~send2~0))) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:27,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {23293#(and (<= 0 ~send2~0) (or (<= ~id2~0 ~id3~0) (and (<= ~send2~0 ~id2~0) (<= ~id2~0 ~send2~0))) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume 0 == ~mode2~0 % 256; {23293#(and (<= 0 ~send2~0) (or (<= ~id2~0 ~id3~0) (and (<= ~send2~0 ~id2~0) (<= ~id2~0 ~send2~0))) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} is VALID [2022-02-20 18:51:27,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {23293#(and (<= 0 ~send2~0) (or (<= ~id2~0 ~id3~0) (and (<= ~send2~0 ~id2~0) (<= ~id2~0 ~send2~0))) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))))} assume ~id3~0 >= 0; {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume 0 == ~st3~0; {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume ~send3~0 == ~id3~0; {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume 0 == ~mode3~0 % 256; {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume ~id1~0 != ~id2~0; {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume ~id1~0 != ~id3~0; {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {23294#(and (<= 0 ~send2~0) (or (<= ~send2~0 ~id2~0) (not (<= (+ ~id2~0 1) ~id3~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~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; {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} assume ~send1~0 != ~nomsg~0; {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~0 ~id2~0)))))} is VALID [2022-02-20 18:51:27,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {23295#(and (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))) (or (<= ~id2~0 ~id3~0) (and (<= ~id2~0 ~send2~0) (<= ~send2~0 (+ ~id3~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; {23296#(and (or (and (or (<= (+ ~send2~0 ~p1_new~0) (+ ~id3~0 ~id2~0 127)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))))} is VALID [2022-02-20 18:51:27,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {23296#(and (or (and (or (<= (+ ~send2~0 ~p1_new~0) (+ ~id3~0 ~id2~0 127)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23296#(and (or (and (or (<= (+ ~send2~0 ~p1_new~0) (+ ~id3~0 ~id2~0 127)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))))} is VALID [2022-02-20 18:51:27,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {23296#(and (or (and (or (<= (+ ~send2~0 ~p1_new~0) (+ ~id3~0 ~id2~0 127)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))))} assume ~send2~0 != ~nomsg~0; {23296#(and (or (and (or (<= (+ ~send2~0 ~p1_new~0) (+ ~id3~0 ~id2~0 127)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))))} is VALID [2022-02-20 18:51:27,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {23296#(and (or (and (or (<= (+ ~send2~0 ~p1_new~0) (+ ~id3~0 ~id2~0 127)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= ~id2~0 ~send2~0)) (<= ~id2~0 ~id3~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= ~send2~0 ~id2~0) (<= (+ ~id2~0 1) ~id3~0) (<= 0 ~send2~0))))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23297#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0) (<= (+ ~p1_new~0 1) ~id2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} is VALID [2022-02-20 18:51:27,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {23297#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0) (<= (+ ~p1_new~0 1) ~id2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23297#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0) (<= (+ ~p1_new~0 1) ~id2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} is VALID [2022-02-20 18:51:27,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {23297#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0) (<= (+ ~p1_new~0 1) ~id2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} assume ~send3~0 != ~nomsg~0; {23297#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0) (<= (+ ~p1_new~0 1) ~id2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~0 ~id2~0))))} is VALID [2022-02-20 18:51:27,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {23297#(and (or (<= (+ ~p2_new~0 1) ~id3~0) (<= ~id2~0 ~p2_new~0) (<= (+ ~p1_new~0 1) ~id2~0)) (or (not (<= ~id2~0 ~id3~0)) (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_new~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; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(~r1~0 % 256 >= 3); {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_2202~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2202~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; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(0 == main_~assert__arg~0#1 % 256); {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode1~0 % 256); {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~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; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node1__m1~1#1 > ~id1~0); {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(main_~node1__m1~1#1 == ~id1~0);~send1~0 := main_~node1__m1~1#1; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} ~mode1~0 := 0; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} is VALID [2022-02-20 18:51:27,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {23298#(and (or (<= ~id2~0 ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0)) (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23299#(and (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)))} is VALID [2022-02-20 18:51:27,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {23299#(and (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)))} assume main_~node2__m2~1#1 != ~nomsg~0; {23299#(and (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)))} is VALID [2022-02-20 18:51:27,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {23299#(and (or (and (<= (+ ~id2~0 1) ~id3~0) (<= ~p2_old~0 ~id2~0)) (not (<= ~id2~0 ~id3~0))) (or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= ~id2~0 ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0)))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {23300#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:27,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {23300#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {23300#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:27,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {23300#(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; {23300#(or (<= (+ ~id3~0 1) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:27,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {23300#(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; {23301#(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:27,886 INFO L290 TraceCheckUtils]: 47: Hoare triple {23301#(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; {23301#(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:27,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {23301#(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); {23302#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:27,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {23302#(<= (+ |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; {23291#false} is VALID [2022-02-20 18:51:27,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {23291#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23291#false} is VALID [2022-02-20 18:51:27,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {23291#false} assume !(~r1~0 % 256 >= 3); {23291#false} is VALID [2022-02-20 18:51:27,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {23291#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~3#1 := 0;~__return_1834~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1834~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; {23291#false} is VALID [2022-02-20 18:51:27,887 INFO L290 TraceCheckUtils]: 53: Hoare triple {23291#false} assume 0 == main_~assert__arg~3#1 % 256; {23291#false} is VALID [2022-02-20 18:51:27,887 INFO L290 TraceCheckUtils]: 54: Hoare triple {23291#false} assume !false; {23291#false} is VALID [2022-02-20 18:51:27,887 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,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:27,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568236136] [2022-02-20 18:51:27,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568236136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:27,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:27,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 18:51:27,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841368122] [2022-02-20 18:51:27,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:27,890 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 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:27,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:27,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 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:27,930 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:27,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:51:27,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:51:27,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:51:27,931 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 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)