./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+sep-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:38,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:38,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:38,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:38,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:38,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:38,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:38,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:38,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:38,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:38,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:38,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:38,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:38,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:38,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:38,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:38,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:38,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:38,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:38,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:38,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:38,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:38,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:38,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:38,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:38,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:38,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:38,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:38,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:38,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:38,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:38,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:38,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:38,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:38,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:38,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:38,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:38,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:38,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:38,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:38,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:38,419 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:38,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:38,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:38,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:38,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:38,434 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:38,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:38,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:38,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:38,435 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:38,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:38,435 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:38,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:38,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:38,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:38,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:38,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:38,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:38,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:38,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:38,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:38,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:38,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:38,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:38,446 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:38,446 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:38,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:38,446 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 -> 7f3df0b4eae1d513bdc1ba52a53496aa05ff593bd28211e99c6fbfee672a86c9 [2022-02-20 18:50:38,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:38,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:38,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:38,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:38,647 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:38,648 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+sep-reducer.c [2022-02-20 18:50:38,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb0d75d5/a1f58a994d28494e94cb9eb5c92608b4/FLAGd296eefcd [2022-02-20 18:50:39,098 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:39,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:50:39,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb0d75d5/a1f58a994d28494e94cb9eb5c92608b4/FLAGd296eefcd [2022-02-20 18:50:39,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcb0d75d5/a1f58a994d28494e94cb9eb5c92608b4 [2022-02-20 18:50:39,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:39,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:39,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:39,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:39,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:39,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:39" (1/1) ... [2022-02-20 18:50:39,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ec19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:39, skipping insertion in model container [2022-02-20 18:50:39,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:39" (1/1) ... [2022-02-20 18:50:39,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:39,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:39,630 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+sep-reducer.c[5819,5832] [2022-02-20 18:50:39,645 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+sep-reducer.c[8492,8505] [2022-02-20 18:50:39,666 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+sep-reducer.c[11299,11312] [2022-02-20 18:50:39,675 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+sep-reducer.c[13874,13887] [2022-02-20 18:50:39,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16880,16893] [2022-02-20 18:50:39,695 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+sep-reducer.c[19470,19483] [2022-02-20 18:50:39,705 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+sep-reducer.c[22230,22243] [2022-02-20 18:50:39,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:39,738 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:39,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[5819,5832] [2022-02-20 18:50:39,788 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+sep-reducer.c[8492,8505] [2022-02-20 18:50:39,802 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+sep-reducer.c[11299,11312] [2022-02-20 18:50:39,809 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+sep-reducer.c[13874,13887] [2022-02-20 18:50:39,819 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+sep-reducer.c[16880,16893] [2022-02-20 18:50:39,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+sep-reducer.c[19470,19483] [2022-02-20 18:50:39,830 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+sep-reducer.c[22230,22243] [2022-02-20 18:50:39,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:39,855 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:39,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:39 WrapperNode [2022-02-20 18:50:39,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:39,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:39,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:39,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:39,861 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:39" (1/1) ... [2022-02-20 18:50:39,874 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:39" (1/1) ... [2022-02-20 18:50:39,925 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1247 [2022-02-20 18:50:39,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:39,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:39,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:39,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:39,932 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:39" (1/1) ... [2022-02-20 18:50:39,937 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:39" (1/1) ... [2022-02-20 18:50:39,947 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:39" (1/1) ... [2022-02-20 18:50:39,948 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:39" (1/1) ... [2022-02-20 18:50:39,959 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:39" (1/1) ... [2022-02-20 18:50:39,973 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:39" (1/1) ... [2022-02-20 18:50:39,975 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:39" (1/1) ... [2022-02-20 18:50:39,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:39,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:39,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:39,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:39,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:39" (1/1) ... [2022-02-20 18:50:39,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:40,022 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:40,028 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:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:40,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:40,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:40,175 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:40,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:40,981 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:40,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:40,994 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:40,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:40 BoogieIcfgContainer [2022-02-20 18:50:40,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:40,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:40,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:41,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:41,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:39" (1/3) ... [2022-02-20 18:50:41,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bde2765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:41, skipping insertion in model container [2022-02-20 18:50:41,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:39" (2/3) ... [2022-02-20 18:50:41,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bde2765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:41, skipping insertion in model container [2022-02-20 18:50:41,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:40" (3/3) ... [2022-02-20 18:50:41,004 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2022-02-20 18:50:41,007 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:41,007 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-02-20 18:50:41,056 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:41,061 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:41,061 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 18:50:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:41,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:41,086 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:41,087 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash -102713619, now seen corresponding path program 1 times [2022-02-20 18:50:41,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:41,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056985998] [2022-02-20 18:50:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:41,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:41,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {271#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {272#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:41,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {272#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:41,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {273#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:41,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {273#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~1#1; {270#false} is VALID [2022-02-20 18:50:41,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {270#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~1#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~1#1 % 256 else main_~node3____CPAchecker_TMP_0~1#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~6#1; {270#false} is VALID [2022-02-20 18:50:41,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {270#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {270#false} is VALID [2022-02-20 18:50:41,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {270#false} assume !(~r1~0 % 256 >= 3); {270#false} is VALID [2022-02-20 18:50:41,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {270#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {270#false} is VALID [2022-02-20 18:50:41,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {270#false} assume ~r1~0 % 256 < 3;main_~check__tmp~6#1 := 1;~__return_371~0 := main_~check__tmp~6#1;main_~main__c1~0#1 := ~__return_371~0;havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~6#1;main_~assert__arg~6#1 := main_~__tmp_7~0#1; {270#false} is VALID [2022-02-20 18:50:41,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {270#false} assume !(0 == main_~assert__arg~6#1 % 256);havoc main_~node1__m1~4#1;main_~node1__m1~4#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {270#false} assume !(0 == ~mode1~0 % 256); {270#false} is VALID [2022-02-20 18:50:41,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {270#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~4#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {270#false} assume !(main_~node1__m1~4#1 != ~nomsg~0);~mode1~0 := 0; {270#false} is VALID [2022-02-20 18:50:41,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {270#false} havoc main_~node2__m2~4#1;main_~node2__m2~4#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {270#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~4#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {270#false} assume main_~node2__m2~4#1 != ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {270#false} assume !(main_~node2__m2~4#1 > ~id2~0); {270#false} is VALID [2022-02-20 18:50:41,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {270#false} assume main_~node2__m2~4#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {270#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {270#false} is VALID [2022-02-20 18:50:41,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {270#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {270#false} is VALID [2022-02-20 18:50:41,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {270#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {270#false} is VALID [2022-02-20 18:50:41,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {270#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {270#false} is VALID [2022-02-20 18:50:41,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {270#false} assume !(~r1~0 % 256 >= 3); {270#false} is VALID [2022-02-20 18:50:41,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {270#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~7#1 := 0;~__return_848~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_848~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {270#false} is VALID [2022-02-20 18:50:41,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {270#false} assume 0 == main_~assert__arg~7#1 % 256; {270#false} is VALID [2022-02-20 18:50:41,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-02-20 18:50:41,349 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:41,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:41,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056985998] [2022-02-20 18:50:41,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056985998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:41,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:41,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:41,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533682717] [2022-02-20 18:50:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:41,355 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:41,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:41,358 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:41,393 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:41,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:41,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:41,410 INFO L87 Difference]: Start difference. First operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,159 INFO L93 Difference]: Finished difference Result 343 states and 586 transitions. [2022-02-20 18:50:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:42,160 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:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:42,163 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:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-02-20 18:50:42,175 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:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-02-20 18:50:42,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-02-20 18:50:42,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:42,628 INFO L225 Difference]: With dead ends: 343 [2022-02-20 18:50:42,629 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 18:50:42,631 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:42,633 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 928 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:42,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 249 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:42,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 18:50:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-02-20 18:50:42,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:42,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,714 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,714 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,719 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-02-20 18:50:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-02-20 18:50:42,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:42,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:42,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 18:50:42,721 INFO L87 Difference]: Start difference. First operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 193 states. [2022-02-20 18:50:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,725 INFO L93 Difference]: Finished difference Result 193 states and 238 transitions. [2022-02-20 18:50:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-02-20 18:50:42,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:42,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:42,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:42,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2022-02-20 18:50:42,731 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 47 [2022-02-20 18:50:42,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:42,731 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2022-02-20 18:50:42,731 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:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2022-02-20 18:50:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:42,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:42,732 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:42,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:42,733 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:42,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:42,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1933719334, now seen corresponding path program 1 times [2022-02-20 18:50:42,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:42,734 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186083433] [2022-02-20 18:50:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:42,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {1301#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {1303#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:42,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {1303#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {1304#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:42,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {1304#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:42,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {1304#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1305#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {1305#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~2#1; {1302#false} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {1302#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1302#false} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {1302#false} assume !(~r1~0 % 256 >= 3); {1302#false} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {1302#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1302#false} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {1302#false} assume ~r1~0 % 256 < 3;main_~check__tmp~2#1 := 1;~__return_399~0 := main_~check__tmp~2#1;main_~main__c1~0#1 := ~__return_399~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {1302#false} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {1302#false} assume !(0 == main_~assert__arg~2#1 % 256);havoc main_~node1__m1~2#1;main_~node1__m1~2#1 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {1302#false} assume !(0 == ~mode1~0 % 256); {1302#false} is VALID [2022-02-20 18:50:42,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {1302#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~2#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {1302#false} assume !(main_~node1__m1~2#1 != ~nomsg~0);~mode1~0 := 0; {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {1302#false} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {1302#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {1302#false} assume main_~node2__m2~2#1 != ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {1302#false} assume !(main_~node2__m2~2#1 > ~id2~0); {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {1302#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {1302#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {1302#false} assume main_~node3__m3~2#1 != ~nomsg~0; {1302#false} is VALID [2022-02-20 18:50:42,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {1302#false} assume !(main_~node3__m3~2#1 > ~id3~0); {1302#false} is VALID [2022-02-20 18:50:42,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {1302#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {1302#false} is VALID [2022-02-20 18:50:42,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {1302#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1035~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1035~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {1302#false} is VALID [2022-02-20 18:50:42,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#false} assume 0 == main_~assert__arg~3#1 % 256; {1302#false} is VALID [2022-02-20 18:50:42,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {1302#false} assume !false; {1302#false} is VALID [2022-02-20 18:50:42,846 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:42,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:42,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186083433] [2022-02-20 18:50:42,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186083433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:42,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:42,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:42,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412962594] [2022-02-20 18:50:42,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:42,848 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:42,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:42,848 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:42,879 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:42,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:42,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:42,879 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:43,323 INFO L93 Difference]: Finished difference Result 279 states and 353 transitions. [2022-02-20 18:50:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:43,324 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:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:43,324 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:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 353 transitions. [2022-02-20 18:50:43,326 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:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 353 transitions. [2022-02-20 18:50:43,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 353 transitions. [2022-02-20 18:50:43,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:43,575 INFO L225 Difference]: With dead ends: 279 [2022-02-20 18:50:43,575 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 18:50:43,575 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:43,576 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 592 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:43,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 139 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 18:50:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-02-20 18:50:43,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:43,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,663 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,663 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:43,666 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2022-02-20 18:50:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2022-02-20 18:50:43,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:43,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:43,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 177 states. [2022-02-20 18:50:43,668 INFO L87 Difference]: Start difference. First operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 177 states. [2022-02-20 18:50:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:43,671 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2022-02-20 18:50:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2022-02-20 18:50:43,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:43,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:43,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:43,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 170 states have (on average 1.2882352941176471) internal successors, (219), 176 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 219 transitions. [2022-02-20 18:50:43,675 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 219 transitions. Word has length 47 [2022-02-20 18:50:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:43,675 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 219 transitions. [2022-02-20 18:50:43,675 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:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2022-02-20 18:50:43,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:43,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:43,676 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:43,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:43,677 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 458596476, now seen corresponding path program 1 times [2022-02-20 18:50:43,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:43,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342472036] [2022-02-20 18:50:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:43,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {2213#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {2215#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:43,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2215#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:43,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {2215#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:43,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {2215#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {2216#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:43,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {2216#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {2216#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:43,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2217#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:43,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {2217#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {2214#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~1#1; {2214#false} is VALID [2022-02-20 18:50:43,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {2214#false} assume ~send2~0 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {2214#false} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~1#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~1#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~1#1 % 256 else main_~node2____CPAchecker_TMP_0~1#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~6#1;main_~node3__m3~6#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {2214#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~2#1; {2214#false} is VALID [2022-02-20 18:50:43,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {2214#false} assume ~send3~0 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {2214#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~2#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~2#1 % 256 else main_~node3____CPAchecker_TMP_0~2#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {2214#false} is VALID [2022-02-20 18:50:43,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {2214#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2214#false} is VALID [2022-02-20 18:50:43,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {2214#false} assume !(~r1~0 % 256 >= 3); {2214#false} is VALID [2022-02-20 18:50:43,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {2214#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2214#false} is VALID [2022-02-20 18:50:43,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {2214#false} assume ~r1~0 % 256 < 3;main_~check__tmp~8#1 := 1;~__return_357~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_357~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {2214#false} is VALID [2022-02-20 18:50:43,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#false} assume !(0 == main_~assert__arg~8#1 % 256);havoc main_~node1__m1~5#1;main_~node1__m1~5#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {2214#false} assume !(0 == ~mode1~0 % 256); {2214#false} is VALID [2022-02-20 18:50:43,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {2214#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~5#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {2214#false} assume main_~node1__m1~5#1 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {2214#false} assume !(main_~node1__m1~5#1 > ~id1~0); {2214#false} is VALID [2022-02-20 18:50:43,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {2214#false} assume main_~node1__m1~5#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~6#1;main_~node2__m2~6#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {2214#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~6#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {2214#false} assume !(main_~node2__m2~6#1 != ~nomsg~0);~mode2~0 := 0; {2214#false} is VALID [2022-02-20 18:50:43,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {2214#false} havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {2214#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {2214#false} assume main_~node3__m3~7#1 != ~nomsg~0; {2214#false} is VALID [2022-02-20 18:50:43,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {2214#false} assume !(main_~node3__m3~7#1 > ~id3~0); {2214#false} is VALID [2022-02-20 18:50:43,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {2214#false} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~9#1; {2214#false} is VALID [2022-02-20 18:50:43,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {2214#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_766~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_766~0;havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~9#1;main_~assert__arg~9#1 := main_~__tmp_10~0#1; {2214#false} is VALID [2022-02-20 18:50:43,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {2214#false} assume 0 == main_~assert__arg~9#1 % 256; {2214#false} is VALID [2022-02-20 18:50:43,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {2214#false} assume !false; {2214#false} is VALID [2022-02-20 18:50:43,772 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,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:43,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342472036] [2022-02-20 18:50:43,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342472036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:43,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:43,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:43,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540450352] [2022-02-20 18:50:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:43,776 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:43,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:43,777 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:43,806 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:43,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:43,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:43,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:43,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:43,807 INFO L87 Difference]: Start difference. First operand 177 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,371 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2022-02-20 18:50:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:44,371 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:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:44,372 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:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2022-02-20 18:50:44,375 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:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2022-02-20 18:50:44,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 435 transitions. [2022-02-20 18:50:44,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 435 edges. 435 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: 339 [2022-02-20 18:50:44,663 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 18:50:44,664 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:44,665 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 760 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:44,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 190 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 18:50:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2022-02-20 18:50:44,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:44,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 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:44,860 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 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:44,860 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 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:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,865 INFO L93 Difference]: Finished difference Result 239 states and 304 transitions. [2022-02-20 18:50:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 304 transitions. [2022-02-20 18:50:44,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:44,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:44,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 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 239 states. [2022-02-20 18:50:44,866 INFO L87 Difference]: Start difference. First operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 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 239 states. [2022-02-20 18:50:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,871 INFO L93 Difference]: Finished difference Result 239 states and 304 transitions. [2022-02-20 18:50:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 304 transitions. [2022-02-20 18:50:44,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:44,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:44,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:44,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3509615384615385) internal successors, (281), 214 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:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2022-02-20 18:50:44,877 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 47 [2022-02-20 18:50:44,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:44,877 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2022-02-20 18:50:44,878 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:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2022-02-20 18:50:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:44,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:44,879 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:44,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:44,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1498085814, now seen corresponding path program 1 times [2022-02-20 18:50:44,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:44,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393280060] [2022-02-20 18:50:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {3391#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {3393#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:45,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {3393#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {3394#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {3395#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {3395#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {3395#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {3395#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:45,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {3396#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3397#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:45,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {3397#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3397#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:45,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {3397#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:50:45,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#(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; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {3398#(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; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3398#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:45,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {3398#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3399#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:50:45,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {3399#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0);~mode3~0 := 0; {3392#false} is VALID [2022-02-20 18:50:45,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {3392#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {3392#false} is VALID [2022-02-20 18:50:45,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {3392#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_942~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_942~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; {3392#false} is VALID [2022-02-20 18:50:45,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {3392#false} assume 0 == main_~assert__arg~5#1 % 256; {3392#false} is VALID [2022-02-20 18:50:45,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {3392#false} assume !false; {3392#false} is VALID [2022-02-20 18:50:45,072 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,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393280060] [2022-02-20 18:50:45,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393280060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:45,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871842705] [2022-02-20 18:50:45,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:45,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,108 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:45,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:45,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:45,111 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,387 INFO L93 Difference]: Finished difference Result 530 states and 734 transitions. [2022-02-20 18:50:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:47,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 437 transitions. [2022-02-20 18:50:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 437 transitions. [2022-02-20 18:50:47,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 437 transitions. [2022-02-20 18:50:47,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:47,742 INFO L225 Difference]: With dead ends: 530 [2022-02-20 18:50:47,742 INFO L226 Difference]: Without dead ends: 525 [2022-02-20 18:50:47,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:50:47,749 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1209 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:47,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1209 Valid, 613 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-02-20 18:50:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 215. [2022-02-20 18:50:47,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:47,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 525 states. Second operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 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:47,968 INFO L74 IsIncluded]: Start isIncluded. First operand 525 states. Second operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 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:47,969 INFO L87 Difference]: Start difference. First operand 525 states. Second operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 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:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,979 INFO L93 Difference]: Finished difference Result 525 states and 729 transitions. [2022-02-20 18:50:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 729 transitions. [2022-02-20 18:50:47,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 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 525 states. [2022-02-20 18:50:47,981 INFO L87 Difference]: Start difference. First operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 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 525 states. [2022-02-20 18:50:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,992 INFO L93 Difference]: Finished difference Result 525 states and 729 transitions. [2022-02-20 18:50:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 729 transitions. [2022-02-20 18:50:47,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:47,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 214 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:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2022-02-20 18:50:47,997 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 48 [2022-02-20 18:50:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:47,997 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2022-02-20 18:50:47,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2022-02-20 18:50:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:47,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:47,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:47,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:47,998 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:47,999 INFO L85 PathProgramCache]: Analyzing trace with hash 267052195, now seen corresponding path program 1 times [2022-02-20 18:50:48,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:48,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791413653] [2022-02-20 18:50:48,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:48,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:48,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {5454#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {5456#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:48,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {5456#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {5457#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {5457#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {5457#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {5457#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {5458#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {5458#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {5458#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {5458#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {5459#(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; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {5459#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:48,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {5459#(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; {5460#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:48,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {5460#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5460#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:48,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {5460#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {5460#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:48,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {5460#(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; {5460#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:48,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {5460#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5460#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:48,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {5460#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {5460#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:48,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {5460#(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; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 % 256 >= 3); {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256); {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {5461#(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; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {5461#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:48,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {5461#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5462#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:48,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {5462#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0);~mode2~0 := 0; {5455#false} is VALID [2022-02-20 18:50:48,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {5455#false} havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {5455#false} is VALID [2022-02-20 18:50:48,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {5455#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5455#false} is VALID [2022-02-20 18:50:48,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {5455#false} assume main_~node3__m3~7#1 != ~nomsg~0; {5455#false} is VALID [2022-02-20 18:50:48,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {5455#false} assume !(main_~node3__m3~7#1 > ~id3~0); {5455#false} is VALID [2022-02-20 18:50:48,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {5455#false} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~9#1; {5455#false} is VALID [2022-02-20 18:50:48,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {5455#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_766~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_766~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; {5455#false} is VALID [2022-02-20 18:50:48,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {5455#false} assume 0 == main_~assert__arg~9#1 % 256; {5455#false} is VALID [2022-02-20 18:50:48,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {5455#false} assume !false; {5455#false} is VALID [2022-02-20 18:50:48,191 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:48,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:48,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791413653] [2022-02-20 18:50:48,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791413653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:48,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:48,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:48,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359823857] [2022-02-20 18:50:48,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:48,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:48,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:48,224 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:48,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:48,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:48,226 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,478 INFO L93 Difference]: Finished difference Result 534 states and 737 transitions. [2022-02-20 18:50:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:50:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 521 transitions. [2022-02-20 18:50:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 521 transitions. [2022-02-20 18:50:50,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 521 transitions. [2022-02-20 18:50:50,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,855 INFO L225 Difference]: With dead ends: 534 [2022-02-20 18:50:50,855 INFO L226 Difference]: Without dead ends: 433 [2022-02-20 18:50:50,856 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:50,856 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 1028 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 818 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:50,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1028 Valid, 818 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:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-02-20 18:50:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 215. [2022-02-20 18:50:51,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 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:51,149 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 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:51,150 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 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:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,158 INFO L93 Difference]: Finished difference Result 433 states and 589 transitions. [2022-02-20 18:50:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 589 transitions. [2022-02-20 18:50:51,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 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 433 states. [2022-02-20 18:50:51,160 INFO L87 Difference]: Start difference. First operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 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 433 states. [2022-02-20 18:50:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,169 INFO L93 Difference]: Finished difference Result 433 states and 589 transitions. [2022-02-20 18:50:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 589 transitions. [2022-02-20 18:50:51,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 214 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:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2022-02-20 18:50:51,173 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 48 [2022-02-20 18:50:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,173 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2022-02-20 18:50:51,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2022-02-20 18:50:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:51,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,175 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:51,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:51,175 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1788008380, now seen corresponding path program 1 times [2022-02-20 18:50:51,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329736047] [2022-02-20 18:50:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:51,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {7332#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {7334#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:51,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {7334#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0 % 256; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:51,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {7335#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {7336#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {7336#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {7336#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:51,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {7336#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:50:51,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {7337#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7338#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:51,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {7338#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7338#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:51,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {7338#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 3); {7338#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:51,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {7338#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {7338#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:51,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {7338#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7338#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:51,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {7338#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7338#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:51,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {7338#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {7338#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:51,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {7338#(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; {7339#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {7339#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {7333#false} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {7333#false} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {7333#false} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {7333#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7333#false} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {7333#false} assume main_~node2__m2~2#1 != ~nomsg~0; {7333#false} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {7333#false} assume !(main_~node2__m2~2#1 > ~id2~0); {7333#false} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 40: Hoare triple {7333#false} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {7333#false} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {7333#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7333#false} is VALID [2022-02-20 18:50:51,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {7333#false} assume main_~node3__m3~2#1 != ~nomsg~0; {7333#false} is VALID [2022-02-20 18:50:51,327 INFO L290 TraceCheckUtils]: 43: Hoare triple {7333#false} assume !(main_~node3__m3~2#1 > ~id3~0); {7333#false} is VALID [2022-02-20 18:50:51,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {7333#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {7333#false} is VALID [2022-02-20 18:50:51,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {7333#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1035~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1035~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; {7333#false} is VALID [2022-02-20 18:50:51,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {7333#false} assume 0 == main_~assert__arg~3#1 % 256; {7333#false} is VALID [2022-02-20 18:50:51,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {7333#false} assume !false; {7333#false} is VALID [2022-02-20 18:50:51,327 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:51,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:51,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329736047] [2022-02-20 18:50:51,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329736047] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:51,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:51,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:50:51,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44445578] [2022-02-20 18:50:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:51,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:51,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,365 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:51,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:50:51,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:51,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:50:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:51,366 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,719 INFO L93 Difference]: Finished difference Result 459 states and 614 transitions. [2022-02-20 18:50:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:50:52,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 393 transitions. [2022-02-20 18:50:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 393 transitions. [2022-02-20 18:50:52,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 393 transitions. [2022-02-20 18:50:53,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,015 INFO L225 Difference]: With dead ends: 459 [2022-02-20 18:50:53,015 INFO L226 Difference]: Without dead ends: 335 [2022-02-20 18:50:53,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:50:53,016 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 1180 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:53,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1180 Valid, 302 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-02-20 18:50:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 215. [2022-02-20 18:50:53,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:53,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 335 states. Second operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:53,324 INFO L74 IsIncluded]: Start isIncluded. First operand 335 states. Second operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:53,325 INFO L87 Difference]: Start difference. First operand 335 states. Second operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,329 INFO L93 Difference]: Finished difference Result 335 states and 439 transitions. [2022-02-20 18:50:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-02-20 18:50:53,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 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 335 states. [2022-02-20 18:50:53,331 INFO L87 Difference]: Start difference. First operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 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 335 states. [2022-02-20 18:50:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,335 INFO L93 Difference]: Finished difference Result 335 states and 439 transitions. [2022-02-20 18:50:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-02-20 18:50:53,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:53,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3365384615384615) internal successors, (278), 214 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call 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:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2022-02-20 18:50:53,339 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 48 [2022-02-20 18:50:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:53,339 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2022-02-20 18:50:53,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2022-02-20 18:50:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:53,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:53,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:53,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:53,340 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1932349207, now seen corresponding path program 1 times [2022-02-20 18:50:53,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:53,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005655337] [2022-02-20 18:50:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:53,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {8891#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {8891#true} is VALID [2022-02-20 18:50:53,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {8891#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {8893#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:53,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {8893#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {8893#(and (<= ~id3~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:53,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {8893#(and (<= ~id3~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {8894#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:53,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {8894#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {8894#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:53,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {8894#(and (<= 0 ~id1~0) (<= ~id3~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {8895#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:53,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {8895#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {8895#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:53,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {8895#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {8896#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:53,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {8896#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {8896#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:53,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {8896#(and (<= 0 ~id1~0) (<= ~id3~0 (+ ~id2~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {8897#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:53,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {8897#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {8897#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:53,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {8897#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {8898#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:53,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {8898#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {8898#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:53,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {8898#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {8899#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8900#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {8900#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8900#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {8900#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {8900#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:53,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {8900#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8901#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:50:53,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {8901#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8901#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:50:53,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {8901#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} assume ~send3~0 != ~nomsg~0; {8901#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} is VALID [2022-02-20 18:50:53,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {8901#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~id3~0 129) ~p2_new~0) (and (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)) (<= 0 ~id1~0) (<= 0 ~send3~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:50:53,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:50:53,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:50:53,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:50:53,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:50:53,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:50:53,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:50:53,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {8902#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8903#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {8903#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {8903#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {8903#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {8904#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {8904#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0; {8904#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {8904#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {8904#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {8904#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8905#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {8905#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {8905#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {8905#(or (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {8906#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {8906#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {8907#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:50:53,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {8907#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8908#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:53,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {8908#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume main_~node3__m3~2#1 != ~nomsg~0; {8908#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} is VALID [2022-02-20 18:50:53,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {8908#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~2#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0))} assume !(main_~node3__m3~2#1 > ~id3~0); {8909#(<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0)} is VALID [2022-02-20 18:50:53,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {8909#(<= (+ |ULTIMATE.start_main_~node3__m3~2#1| 1) ~id3~0)} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {8892#false} is VALID [2022-02-20 18:50:53,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {8892#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1035~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1035~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; {8892#false} is VALID [2022-02-20 18:50:53,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {8892#false} assume 0 == main_~assert__arg~3#1 % 256; {8892#false} is VALID [2022-02-20 18:50:53,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {8892#false} assume !false; {8892#false} is VALID [2022-02-20 18:50:53,922 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:53,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:53,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005655337] [2022-02-20 18:50:53,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005655337] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:53,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:53,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:50:53,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977573100] [2022-02-20 18:50:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:53,923 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:53,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:53,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:50:53,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:53,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:50:53,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:50:53,963 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,073 INFO L93 Difference]: Finished difference Result 403 states and 529 transitions. [2022-02-20 18:50:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 18:50:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 453 transitions. [2022-02-20 18:50:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 453 transitions. [2022-02-20 18:50:59,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 453 transitions. [2022-02-20 18:50:59,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,448 INFO L225 Difference]: With dead ends: 403 [2022-02-20 18:50:59,448 INFO L226 Difference]: Without dead ends: 399 [2022-02-20 18:50:59,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 18:50:59,450 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 1179 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:59,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 2242 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 18:50:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-02-20 18:50:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 219. [2022-02-20 18:50:59,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:59,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 399 states. Second operand has 219 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 218 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call 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,904 INFO L74 IsIncluded]: Start isIncluded. First operand 399 states. Second operand has 219 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 218 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call 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,904 INFO L87 Difference]: Start difference. First operand 399 states. Second operand has 219 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 218 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call 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,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,911 INFO L93 Difference]: Finished difference Result 399 states and 525 transitions. [2022-02-20 18:50:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 525 transitions. [2022-02-20 18:50:59,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 218 states have internal predecessors, (284), 0 states have call successors, (0), 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 399 states. [2022-02-20 18:50:59,912 INFO L87 Difference]: Start difference. First operand has 219 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 218 states have internal predecessors, (284), 0 states have call successors, (0), 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 399 states. [2022-02-20 18:50:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:59,919 INFO L93 Difference]: Finished difference Result 399 states and 525 transitions. [2022-02-20 18:50:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 525 transitions. [2022-02-20 18:50:59,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:59,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:59,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:59,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 218 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call 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,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2022-02-20 18:50:59,923 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 50 [2022-02-20 18:50:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:59,923 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2022-02-20 18:50:59,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2022-02-20 18:50:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:59,924 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:59,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:59,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:59,925 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:50:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1779763646, now seen corresponding path program 1 times [2022-02-20 18:50:59,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:59,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140806010] [2022-02-20 18:50:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:59,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:00,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {10541#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {10541#true} is VALID [2022-02-20 18:51:00,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {10541#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {10543#(and (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:00,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {10543#(and (<= ~send1~0 127) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {10543#(and (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:00,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {10543#(and (<= ~send1~0 127) (<= ~id3~0 127))} assume ~id1~0 >= 0; {10544#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:00,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {10544#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} assume 0 == ~st1~0; {10544#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:00,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {10544#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {10545#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {10545#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {10545#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {10545#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {10546#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {10546#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {10546#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {10546#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {10547#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {10547#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {10547#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {10547#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {10548#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {10548#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {10548#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {10548#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:00,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {10549#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10550#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {10550#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10550#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {10550#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {10550#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:00,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {10550#(or (and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10551#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:00,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {10551#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10551#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:00,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {10551#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {10551#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:00,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {10551#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {10552#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10553#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {10553#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {10553#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {10553#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {10554#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {10554#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10555#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:00,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {10555#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10556#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {10556#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {10556#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {10556#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {10557#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {10557#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0; {10557#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {10557#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {10557#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:00,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {10557#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10558#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:00,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {10558#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} assume main_~node3__m3~7#1 != ~nomsg~0; {10558#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:00,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {10558#(or (<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0) (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~7#1|))} assume !(main_~node3__m3~7#1 > ~id3~0); {10559#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:00,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {10559#(<= (+ |ULTIMATE.start_main_~node3__m3~7#1| 1) ~id3~0)} assume main_~node3__m3~7#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~9#1; {10542#false} is VALID [2022-02-20 18:51:00,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {10542#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~9#1 := 0;~__return_766~0 := main_~check__tmp~9#1;main_~main__c1~0#1 := ~__return_766~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; {10542#false} is VALID [2022-02-20 18:51:00,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {10542#false} assume 0 == main_~assert__arg~9#1 % 256; {10542#false} is VALID [2022-02-20 18:51:00,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {10542#false} assume !false; {10542#false} is VALID [2022-02-20 18:51:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:00,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:00,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140806010] [2022-02-20 18:51:00,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140806010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:00,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:00,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:00,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876947222] [2022-02-20 18:51:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:00,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:00,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:00,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:00,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:00,529 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:05,321 INFO L93 Difference]: Finished difference Result 472 states and 643 transitions. [2022-02-20 18:51:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 18:51:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 489 transitions. [2022-02-20 18:51:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 489 transitions. [2022-02-20 18:51:05,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 489 transitions. [2022-02-20 18:51:05,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,663 INFO L225 Difference]: With dead ends: 472 [2022-02-20 18:51:05,663 INFO L226 Difference]: Without dead ends: 384 [2022-02-20 18:51:05,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 18:51:05,664 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 924 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:05,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 1983 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:51:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-02-20 18:51:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 225. [2022-02-20 18:51:06,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:06,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 225 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call 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,196 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 225 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call 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,196 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 225 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call 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,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:06,203 INFO L93 Difference]: Finished difference Result 384 states and 510 transitions. [2022-02-20 18:51:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 510 transitions. [2022-02-20 18:51:06,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:06,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:06,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 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 384 states. [2022-02-20 18:51:06,205 INFO L87 Difference]: Start difference. First operand has 225 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 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 384 states. [2022-02-20 18:51:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:06,213 INFO L93 Difference]: Finished difference Result 384 states and 510 transitions. [2022-02-20 18:51:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 510 transitions. [2022-02-20 18:51:06,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:06,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:06,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:06,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 224 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call 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,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 292 transitions. [2022-02-20 18:51:06,218 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 292 transitions. Word has length 50 [2022-02-20 18:51:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:06,218 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 292 transitions. [2022-02-20 18:51:06,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 292 transitions. [2022-02-20 18:51:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:06,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:06,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:06,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:51:06,219 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1793833253, now seen corresponding path program 1 times [2022-02-20 18:51:06,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:06,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016700276] [2022-02-20 18:51:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:06,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {12262#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {12262#true} is VALID [2022-02-20 18:51:06,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {12264#(and (<= ~send1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:06,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {12264#(and (<= ~send1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {12264#(and (<= ~send1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:06,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {12264#(and (<= ~send1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {12265#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:06,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {12265#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {12265#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:06,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {12265#(and (<= 0 ~id1~0) (<= ~send1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {12266#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:06,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {12266#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} assume 0 == ~mode1~0 % 256; {12266#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:06,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {12266#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0))} assume ~id2~0 >= 0; {12267#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {12267#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {12267#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {12267#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {12268#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {12268#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {12268#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {12268#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {12269#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {12269#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {12269#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {12269#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode3~0 % 256; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id1~0 != ~id2~0; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id1~0 != ~id3~0; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send1~0 != ~nomsg~0; {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:06,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {12270#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12271#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)))} is VALID [2022-02-20 18:51:06,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {12271#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12271#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)))} is VALID [2022-02-20 18:51:06,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {12271#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)))} assume ~send2~0 != ~nomsg~0; {12271#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0)))} is VALID [2022-02-20 18:51:06,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {12271#(and (<= 0 ~id3~0) (<= 0 ~send2~0) (or (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~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; {12272#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:06,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {12272#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12272#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:06,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {12272#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {12272#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} is VALID [2022-02-20 18:51:06,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {12272#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= 0 ~id1~0) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id2~0 129) ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {12273#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12274#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {12274#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {12274#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {12274#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {12275#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {12275#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12276#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:06,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {12276#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12277#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {12277#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {12277#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {12277#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {12278#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:06,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {12278#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12279#(<= ~p2_old~0 ~id3~0)} is VALID [2022-02-20 18:51:06,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {12279#(<= ~p2_old~0 ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12280#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} is VALID [2022-02-20 18:51:06,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {12280#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} assume main_~node3__m3~1#1 != ~nomsg~0; {12280#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} is VALID [2022-02-20 18:51:06,830 INFO L290 TraceCheckUtils]: 44: Hoare triple {12280#(<= |ULTIMATE.start_main_~node3__m3~1#1| ~id3~0)} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {12263#false} is VALID [2022-02-20 18:51:06,830 INFO L290 TraceCheckUtils]: 45: Hoare triple {12263#false} ~mode3~0 := 0; {12263#false} is VALID [2022-02-20 18:51:06,831 INFO L290 TraceCheckUtils]: 46: Hoare triple {12263#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~5#1; {12263#false} is VALID [2022-02-20 18:51:06,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {12263#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_942~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_942~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; {12263#false} is VALID [2022-02-20 18:51:06,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {12263#false} assume 0 == main_~assert__arg~5#1 % 256; {12263#false} is VALID [2022-02-20 18:51:06,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {12263#false} assume !false; {12263#false} is VALID [2022-02-20 18:51:06,831 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,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:06,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016700276] [2022-02-20 18:51:06,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016700276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:06,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:06,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-20 18:51:06,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004706320] [2022-02-20 18:51:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:06,832 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:06,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:06,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:06,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 18:51:06,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 18:51:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:06,876 INFO L87 Difference]: Start difference. First operand 225 states and 292 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:13,416 INFO L93 Difference]: Finished difference Result 589 states and 823 transitions. [2022-02-20 18:51:13,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 18:51:13,416 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 669 transitions. [2022-02-20 18:51:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 669 transitions. [2022-02-20 18:51:13,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 669 transitions. [2022-02-20 18:51:13,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 669 edges. 669 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:13,901 INFO L225 Difference]: With dead ends: 589 [2022-02-20 18:51:13,901 INFO L226 Difference]: Without dead ends: 583 [2022-02-20 18:51:13,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-02-20 18:51:13,902 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 1592 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:13,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1592 Valid, 2454 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 18:51:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-02-20 18:51:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 225. [2022-02-20 18:51:14,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:14,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 583 states. Second operand has 225 states, 218 states have (on average 1.334862385321101) internal successors, (291), 224 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call 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,443 INFO L74 IsIncluded]: Start isIncluded. First operand 583 states. Second operand has 225 states, 218 states have (on average 1.334862385321101) internal successors, (291), 224 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call 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,443 INFO L87 Difference]: Start difference. First operand 583 states. Second operand has 225 states, 218 states have (on average 1.334862385321101) internal successors, (291), 224 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call 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,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:14,454 INFO L93 Difference]: Finished difference Result 583 states and 817 transitions. [2022-02-20 18:51:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 817 transitions. [2022-02-20 18:51:14,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:14,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:14,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 218 states have (on average 1.334862385321101) internal successors, (291), 224 states have internal predecessors, (291), 0 states have call successors, (0), 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 583 states. [2022-02-20 18:51:14,456 INFO L87 Difference]: Start difference. First operand has 225 states, 218 states have (on average 1.334862385321101) internal successors, (291), 224 states have internal predecessors, (291), 0 states have call successors, (0), 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 583 states. [2022-02-20 18:51:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:14,467 INFO L93 Difference]: Finished difference Result 583 states and 817 transitions. [2022-02-20 18:51:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 817 transitions. [2022-02-20 18:51:14,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:14,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:14,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:14,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.334862385321101) internal successors, (291), 224 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call 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,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 291 transitions. [2022-02-20 18:51:14,470 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 291 transitions. Word has length 50 [2022-02-20 18:51:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:14,470 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 291 transitions. [2022-02-20 18:51:14,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 291 transitions. [2022-02-20 18:51:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:51:14,471 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:14,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:14,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:14,472 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1827600366, now seen corresponding path program 1 times [2022-02-20 18:51:14,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:14,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237440649] [2022-02-20 18:51:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:14,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:14,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {14557#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {14557#true} is VALID [2022-02-20 18:51:14,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {14557#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {14559#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:14,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {14559#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {14559#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:14,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {14559#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {14560#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:14,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {14560#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {14560#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:14,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {14560#(and (<= ~id1~0 127) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {14561#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {14561#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode1~0 % 256; {14561#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {14561#(and (<= ~send1~0 127) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 >= 0; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st2~0; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send2~0 == ~id2~0; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode2~0 % 256; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id3~0 >= 0; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st3~0; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send3~0 == ~id3~0; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode3~0 % 256; {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {14562#(and (<= ~send1~0 (+ ~id2~0 127)) (or (< ~id1~0 (+ ~id2~0 1)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id2~0; {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id3~0; {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send1~0 != ~nomsg~0; {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:14,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {14563#(and (<= ~send1~0 (+ ~id2~0 127)) (<= 0 ~id2~0) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~send1~0))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {14564#(or (and (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (not (<= ~id2~0 ~id1~0))) (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 % 256 >= 3); {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode1~0 % 256); {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {14565#(or (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (not (<= ~id2~0 ~id1~0)) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14566#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:14,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {14566#(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; {14567#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:14,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {14567#(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; {14567#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {14567#(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); {14568#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {14568#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14558#false} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {14558#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14558#false} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {14558#false} assume main_~node3__m3~1#1 != ~nomsg~0; {14558#false} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {14558#false} assume !(main_~node3__m3~1#1 > ~id3~0); {14558#false} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {14558#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {14558#false} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {14558#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1146~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1146~0; {14558#false} is VALID [2022-02-20 18:51:14,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {14558#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {14558#false} is VALID [2022-02-20 18:51:14,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {14558#false} assume 0 == main_~assert__arg~1#1 % 256; {14558#false} is VALID [2022-02-20 18:51:14,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {14558#false} assume !false; {14558#false} is VALID [2022-02-20 18:51:14,819 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:14,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:14,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237440649] [2022-02-20 18:51:14,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237440649] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:14,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:14,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:14,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316436668] [2022-02-20 18:51:14,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:14,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:14,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:14,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:14,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:14,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:14,857 INFO L87 Difference]: Start difference. First operand 225 states and 291 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,850 INFO L93 Difference]: Finished difference Result 444 states and 618 transitions. [2022-02-20 18:51:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:51:17,850 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:51:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 398 transitions. [2022-02-20 18:51:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 398 transitions. [2022-02-20 18:51:17,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 398 transitions. [2022-02-20 18:51:18,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:18,156 INFO L225 Difference]: With dead ends: 444 [2022-02-20 18:51:18,157 INFO L226 Difference]: Without dead ends: 349 [2022-02-20 18:51:18,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:51:18,157 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 839 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:18,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 1361 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-02-20 18:51:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 214. [2022-02-20 18:51:18,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:18,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 214 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 213 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:51:18,768 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 214 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 213 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:51:18,768 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 214 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 213 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:51:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:18,772 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2022-02-20 18:51:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 478 transitions. [2022-02-20 18:51:18,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:18,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:18,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 213 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 349 states. [2022-02-20 18:51:18,773 INFO L87 Difference]: Start difference. First operand has 214 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 213 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 349 states. [2022-02-20 18:51:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:18,777 INFO L93 Difference]: Finished difference Result 349 states and 478 transitions. [2022-02-20 18:51:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 478 transitions. [2022-02-20 18:51:18,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:18,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:18,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:18,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 208 states have (on average 1.3413461538461537) internal successors, (279), 213 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:51:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2022-02-20 18:51:18,780 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 50 [2022-02-20 18:51:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:18,781 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2022-02-20 18:51:18,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2022-02-20 18:51:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:18,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:18,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:18,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:18,782 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -767196360, now seen corresponding path program 1 times [2022-02-20 18:51:18,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:18,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460680633] [2022-02-20 18:51:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:18,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {16145#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {16147#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:18,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {16147#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {16148#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {16149#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {16149#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {16149#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {16149#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~send2~0 != ~nomsg~0; {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:18,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {16150#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {16151#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:18,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {16151#(not (= ~nomsg~0 ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16151#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:18,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {16151#(not (= ~nomsg~0 ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {16151#(not (= ~nomsg~0 ~p2_new~0))} is VALID [2022-02-20 18:51:18,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {16151#(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; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume !(~r1~0 % 256 >= 3); {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode1~0 % 256); {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {16152#(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; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {16152#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:18,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {16152#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16153#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} is VALID [2022-02-20 18:51:18,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {16153#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~2#1|))} assume !(main_~node3__m3~2#1 != ~nomsg~0);~mode3~0 := 0; {16146#false} is VALID [2022-02-20 18:51:18,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {16146#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~7#1; {16146#false} is VALID [2022-02-20 18:51:18,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {16146#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16146#false} is VALID [2022-02-20 18:51:18,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {16146#false} assume !(~r1~0 % 256 >= 3); {16146#false} is VALID [2022-02-20 18:51:18,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {16146#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~7#1 := 0;~__return_848~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_848~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; {16146#false} is VALID [2022-02-20 18:51:18,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {16146#false} assume 0 == main_~assert__arg~7#1 % 256; {16146#false} is VALID [2022-02-20 18:51:18,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {16146#false} assume !false; {16146#false} is VALID [2022-02-20 18:51:18,886 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:18,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:18,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460680633] [2022-02-20 18:51:18,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460680633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:18,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:18,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:18,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550317079] [2022-02-20 18:51:18,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:18,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:18,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:18,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:18,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:18,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:18,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:18,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:18,921 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:20,959 INFO L93 Difference]: Finished difference Result 349 states and 461 transitions. [2022-02-20 18:51:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:51:20,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 286 transitions. [2022-02-20 18:51:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 286 transitions. [2022-02-20 18:51:20,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 286 transitions. [2022-02-20 18:51:21,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:21,179 INFO L225 Difference]: With dead ends: 349 [2022-02-20 18:51:21,179 INFO L226 Difference]: Without dead ends: 342 [2022-02-20 18:51:21,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-02-20 18:51:21,179 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 949 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:21,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [949 Valid, 471 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-20 18:51:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 214. [2022-02-20 18:51:21,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:21,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 214 states, 208 states have (on average 1.3317307692307692) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,756 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 214 states, 208 states have (on average 1.3317307692307692) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,756 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 214 states, 208 states have (on average 1.3317307692307692) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,760 INFO L93 Difference]: Finished difference Result 342 states and 453 transitions. [2022-02-20 18:51:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 453 transitions. [2022-02-20 18:51:21,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:21,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:21,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 208 states have (on average 1.3317307692307692) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 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 342 states. [2022-02-20 18:51:21,761 INFO L87 Difference]: Start difference. First operand has 214 states, 208 states have (on average 1.3317307692307692) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 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 342 states. [2022-02-20 18:51:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,766 INFO L93 Difference]: Finished difference Result 342 states and 453 transitions. [2022-02-20 18:51:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 453 transitions. [2022-02-20 18:51:21,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:21,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:21,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:21,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 208 states have (on average 1.3317307692307692) internal successors, (277), 213 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 277 transitions. [2022-02-20 18:51:21,771 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 277 transitions. Word has length 51 [2022-02-20 18:51:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:21,771 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 277 transitions. [2022-02-20 18:51:21,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 277 transitions. [2022-02-20 18:51:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:21,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:21,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:21,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:21,772 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:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1195663953, now seen corresponding path program 1 times [2022-02-20 18:51:21,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:21,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828982071] [2022-02-20 18:51:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:21,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {17580#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {17582#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:21,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {17582#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {17583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {17583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {17583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {17583#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {17584#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {17584#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {17584#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {17584#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:21,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {17585#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:21,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:21,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~send2~0 != ~nomsg~0; {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:21,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:21,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:21,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~send3~0 != ~nomsg~0; {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:21,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {17586#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:21,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:21,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(~r1~0 % 256 >= 3); {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:21,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:21,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:21,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:21,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == ~mode1~0 % 256); {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:21,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {17587#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {17588#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:51:21,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {17588#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {17588#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:51:21,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {17588#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {17589#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:21,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {17589#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0; {17589#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:21,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {17589#(not (= ~nomsg~0 ~p1_old~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {17589#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:21,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {17589#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17590#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} is VALID [2022-02-20 18:51:21,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {17590#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~2#1|))} assume !(main_~node2__m2~2#1 != ~nomsg~0);~mode2~0 := 0; {17581#false} is VALID [2022-02-20 18:51:21,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {17581#false} havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {17581#false} is VALID [2022-02-20 18:51:21,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {17581#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~8#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17581#false} is VALID [2022-02-20 18:51:21,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {17581#false} assume main_~node3__m3~8#1 != ~nomsg~0; {17581#false} is VALID [2022-02-20 18:51:21,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {17581#false} assume !(main_~node3__m3~8#1 > ~id3~0); {17581#false} is VALID [2022-02-20 18:51:21,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {17581#false} assume main_~node3__m3~8#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~11#1; {17581#false} is VALID [2022-02-20 18:51:21,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17581#false} is VALID [2022-02-20 18:51:21,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume !(~r1~0 % 256 >= 3); {17581#false} is VALID [2022-02-20 18:51:21,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~11#1 := 0;~__return_672~0 := main_~check__tmp~11#1;main_~main__c1~0#1 := ~__return_672~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; {17581#false} is VALID [2022-02-20 18:51:21,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {17581#false} assume 0 == main_~assert__arg~11#1 % 256; {17581#false} is VALID [2022-02-20 18:51:21,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-02-20 18:51:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:21,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:21,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828982071] [2022-02-20 18:51:21,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828982071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:21,946 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:21,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:51:21,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412567920] [2022-02-20 18:51:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:21,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:21,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:21,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:51:21,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:21,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:51:21,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:51:21,980 INFO L87 Difference]: Start difference. First operand 214 states and 277 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:25,480 INFO L93 Difference]: Finished difference Result 547 states and 759 transitions. [2022-02-20 18:51:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 18:51:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 467 transitions. [2022-02-20 18:51:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 467 transitions. [2022-02-20 18:51:25,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 467 transitions. [2022-02-20 18:51:25,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:25,830 INFO L225 Difference]: With dead ends: 547 [2022-02-20 18:51:25,830 INFO L226 Difference]: Without dead ends: 433 [2022-02-20 18:51:25,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:51:25,831 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 1277 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:25,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 752 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-02-20 18:51:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 214. [2022-02-20 18:51:26,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:26,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 214 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 213 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call 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,437 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 214 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 213 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call 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,437 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 214 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 213 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call 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,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,444 INFO L93 Difference]: Finished difference Result 433 states and 594 transitions. [2022-02-20 18:51:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 594 transitions. [2022-02-20 18:51:26,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 213 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 433 states. [2022-02-20 18:51:26,456 INFO L87 Difference]: Start difference. First operand has 214 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 213 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 433 states. [2022-02-20 18:51:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:26,463 INFO L93 Difference]: Finished difference Result 433 states and 594 transitions. [2022-02-20 18:51:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 594 transitions. [2022-02-20 18:51:26,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:26,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:26,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:26,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 208 states have (on average 1.3221153846153846) internal successors, (275), 213 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call 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,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2022-02-20 18:51:26,466 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 51 [2022-02-20 18:51:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:26,467 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2022-02-20 18:51:26,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2022-02-20 18:51:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:26,467 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:26,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:26,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:26,468 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:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 72941877, now seen corresponding path program 1 times [2022-02-20 18:51:26,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:26,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668791748] [2022-02-20 18:51:26,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:26,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {19496#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {19496#true} is VALID [2022-02-20 18:51:26,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {19496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {19498#(<= ~id1~0 127)} is VALID [2022-02-20 18:51:26,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {19498#(<= ~id1~0 127)} assume 0 == ~r1~0 % 256; {19498#(<= ~id1~0 127)} is VALID [2022-02-20 18:51:26,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {19498#(<= ~id1~0 127)} assume ~id1~0 >= 0; {19499#(and (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:26,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {19499#(and (<= 0 ~id1~0) (<= ~id1~0 127))} assume 0 == ~st1~0; {19499#(and (<= 0 ~id1~0) (<= ~id1~0 127))} is VALID [2022-02-20 18:51:26,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {19499#(and (<= 0 ~id1~0) (<= ~id1~0 127))} assume ~send1~0 == ~id1~0; {19500#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {19500#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {19500#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {19500#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {19501#(and (<= ~send1~0 127) (or (<= ~send1~0 ~id1~0) (<= ~id2~0 ~id1~0)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:26,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {19502#(and (or (<= (+ ~id2~0 1) ~id1~0) (and (not (<= ~id2~0 ~id1~0)) (<= ~send1~0 ~id1~0))) (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0;~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {19503#(or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(~r1~0 % 256 >= 3); {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode1~0 % 256); {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {19504#(or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(main_~node1__m1~1#1 == ~id1~0);~send1~0 := main_~node1__m1~1#1; {19505#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {19505#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0; {19505#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {19505#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} havoc main_~node2__m2~2#1;main_~node2__m2~2#1 := ~nomsg~0; {19505#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:26,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {19505#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~2#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19506#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:26,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {19506#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume main_~node2__m2~2#1 != ~nomsg~0; {19506#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {19506#(or (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~2#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0))} assume !(main_~node2__m2~2#1 > ~id2~0); {19507#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {19507#(<= (+ |ULTIMATE.start_main_~node2__m2~2#1| 1) ~id2~0)} assume main_~node2__m2~2#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~2#1;main_~node3__m3~2#1 := ~nomsg~0; {19497#false} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {19497#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~2#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19497#false} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {19497#false} assume main_~node3__m3~2#1 != ~nomsg~0; {19497#false} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {19497#false} assume !(main_~node3__m3~2#1 > ~id3~0); {19497#false} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {19497#false} assume main_~node3__m3~2#1 == ~id3~0;~st3~0 := 1;~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~3#1; {19497#false} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {19497#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~3#1 := 0;~__return_1035~0 := main_~check__tmp~3#1;main_~main__c1~0#1 := ~__return_1035~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; {19497#false} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {19497#false} assume 0 == main_~assert__arg~3#1 % 256; {19497#false} is VALID [2022-02-20 18:51:26,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {19497#false} assume !false; {19497#false} is VALID [2022-02-20 18:51:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:26,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:26,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668791748] [2022-02-20 18:51:26,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668791748] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:26,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:26,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:26,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226034301] [2022-02-20 18:51:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:26,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:26,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:26,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:26,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:26,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:26,797 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:30,006 INFO L93 Difference]: Finished difference Result 457 states and 632 transitions. [2022-02-20 18:51:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:51:30,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 390 transitions. [2022-02-20 18:51:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 390 transitions. [2022-02-20 18:51:30,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 390 transitions. [2022-02-20 18:51:30,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:30,280 INFO L225 Difference]: With dead ends: 457 [2022-02-20 18:51:30,280 INFO L226 Difference]: Without dead ends: 437 [2022-02-20 18:51:30,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:51:30,281 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 956 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:30,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [956 Valid, 1321 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-02-20 18:51:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 194. [2022-02-20 18:51:30,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:30,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 437 states. Second operand has 194 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 193 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:30,897 INFO L74 IsIncluded]: Start isIncluded. First operand 437 states. Second operand has 194 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 193 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:30,897 INFO L87 Difference]: Start difference. First operand 437 states. Second operand has 194 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 193 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:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:30,904 INFO L93 Difference]: Finished difference Result 437 states and 609 transitions. [2022-02-20 18:51:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 609 transitions. [2022-02-20 18:51:30,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:30,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:30,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 193 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 437 states. [2022-02-20 18:51:30,905 INFO L87 Difference]: Start difference. First operand has 194 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 193 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 437 states. [2022-02-20 18:51:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:30,912 INFO L93 Difference]: Finished difference Result 437 states and 609 transitions. [2022-02-20 18:51:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 609 transitions. [2022-02-20 18:51:30,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:30,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:30,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:30,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 193 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:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 252 transitions. [2022-02-20 18:51:30,914 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 252 transitions. Word has length 51 [2022-02-20 18:51:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:30,914 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 252 transitions. [2022-02-20 18:51:30,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 252 transitions. [2022-02-20 18:51:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:51:30,917 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:30,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:30,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:30,918 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 18:51:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash -314877430, now seen corresponding path program 1 times [2022-02-20 18:51:30,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:30,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774086871] [2022-02-20 18:51:30,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:31,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {21251#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_95~0 := 0;~__return_413~0 := 0;~__return_1146~0 := 0;~__return_399~0 := 0;~__return_1035~0 := 0;~__return_385~0 := 0;~__return_942~0 := 0;~__return_371~0 := 0;~__return_848~0 := 0;~__return_357~0 := 0;~__return_766~0 := 0;~__return_343~0 := 0;~__return_672~0 := 0;~__return_329~0 := 0;~__return_593~0 := 0;~__return_315~0 := 0;~__return_513~0 := 0;~__return_1296~0 := 0; {21253#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:31,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {21253#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~2#1, main_~node2__m2~2#1, main_~node1__m1~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~4#1, main_~node2__m2~3#1, main_~node1__m1~3#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~5#1, main_~node2__m2~4#1, main_~node1__m1~4#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~3#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~node3__m3~7#1, main_~node2__m2~6#1, main_~node1__m1~5#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~node3__m3~8#1, main_~node2__m2~7#1, main_~node1__m1~6#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~13#1, main_~node3__m3~10#1, main_~node2__m2~8#1, main_~node1__m1~7#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~check__tmp~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~12#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~10#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~9#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~15#1, main_~node3__m3~11#1, main_~node2__m2~9#1, main_~node1__m1~8#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~9#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {21254#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {21255#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {21255#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {21255#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:31,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {21255#(and (<= (+ ~nomsg~0 1) ~id2~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode2~0 % 256; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id3~0 >= 0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~st3~0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send3~0 == ~id3~0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume 0 == ~mode3~0 % 256; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id2~0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id1~0 != ~id3~0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_95~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_95~0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} 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; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} assume ~send1~0 != ~nomsg~0; {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} is VALID [2022-02-20 18:51:31,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {21256#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= ~send2~0 (+ ~nomsg~0 ~id2~0 1)))} 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; {21257#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:51:31,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {21257#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21257#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:51:31,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {21257#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~send2~0 != ~nomsg~0; {21257#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} is VALID [2022-02-20 18:51:31,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {21257#(and (<= (+ ~nomsg~0 1) ~send2~0) (<= ~send2~0 (+ ~nomsg~0 128)) (<= (+ ~send2~0 ~p1_new~0) (+ ~nomsg~0 ~id2~0 128)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {21258#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:31,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {21258#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21258#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:31,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {21258#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} assume ~send3~0 != ~nomsg~0; {21258#(or (<= (+ ~p1_new~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_new~0)))} is VALID [2022-02-20 18:51:31,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {21258#(or (<= (+ ~p1_new~0 1) ~id2~0) (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; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(~r1~0 % 256 >= 3); {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_413~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_413~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == ~mode1~0 % 256); {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (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; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(main_~node1__m1~1#1 > ~id1~0); {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {21259#(or (<= (+ ~p1_old~0 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21260#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {21260#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~1#1 != ~nomsg~0; {21260#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} is VALID [2022-02-20 18:51:31,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {21260#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (not (= ~nomsg~0 ~p2_old~0)))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {21261#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:31,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {21261#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0; {21261#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:31,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {21261#(not (= ~nomsg~0 ~p2_old~0))} havoc main_~node3__m3~7#1;main_~node3__m3~7#1 := ~nomsg~0; {21261#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:51:31,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {21261#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~7#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21262#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~7#1|))} is VALID [2022-02-20 18:51:31,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {21262#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~7#1|))} assume !(main_~node3__m3~7#1 != ~nomsg~0);~mode3~0 := 0; {21252#false} is VALID [2022-02-20 18:51:31,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {21252#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~13#1; {21252#false} is VALID [2022-02-20 18:51:31,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {21252#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21252#false} is VALID [2022-02-20 18:51:31,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {21252#false} assume !(~r1~0 % 256 >= 3); {21252#false} is VALID [2022-02-20 18:51:31,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {21252#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~13#1 := 0;~__return_593~0 := main_~check__tmp~13#1;main_~main__c1~0#1 := ~__return_593~0;havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~13#1;main_~assert__arg~13#1 := main_~__tmp_14~0#1; {21252#false} is VALID [2022-02-20 18:51:31,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {21252#false} assume 0 == main_~assert__arg~13#1 % 256; {21252#false} is VALID [2022-02-20 18:51:31,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {21252#false} assume !false; {21252#false} is VALID [2022-02-20 18:51:31,099 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:31,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:31,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774086871] [2022-02-20 18:51:31,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774086871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:31,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:31,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:51:31,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457834736] [2022-02-20 18:51:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:31,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:31,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:31,100 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), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:31,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:31,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:31,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:31,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:31,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:31,133 INFO L87 Difference]: Start difference. First operand 194 states and 252 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,023 INFO L93 Difference]: Finished difference Result 980 states and 1396 transitions. [2022-02-20 18:51:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 18:51:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:51:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 757 transitions. [2022-02-20 18:51:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 757 transitions. [2022-02-20 18:51:39,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 757 transitions. [2022-02-20 18:51:39,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 757 edges. 757 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:39,709 INFO L225 Difference]: With dead ends: 980 [2022-02-20 18:51:39,710 INFO L226 Difference]: Without dead ends: 973 [2022-02-20 18:51:39,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 18:51:39,710 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 2179 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:39,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2179 Valid, 896 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 18:51:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states.