./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-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-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-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 851dc7d49dcc9fde277beeb190c3ab252014728a3bd4281f423bffd927fb4430 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:49:21,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:49:21,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:49:21,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:49:21,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:49:21,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:49:21,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:49:21,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:49:21,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:49:21,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:49:21,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:49:21,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:49:21,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:49:21,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:49:21,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:49:21,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:49:21,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:49:21,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:49:21,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:49:21,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:49:21,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:49:21,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:49:21,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:49:21,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:49:21,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:49:21,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:49:21,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:49:21,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:49:21,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:49:21,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:49:21,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:49:21,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:49:21,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:49:21,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:49:21,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:49:21,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:49:21,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:49:21,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:49:21,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:49:21,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:49:21,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:49:21,055 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:49:21,069 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:49:21,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:49:21,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:49:21,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:49:21,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:49:21,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:49:21,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:49:21,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:49:21,071 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:49:21,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:49:21,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:49:21,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:49:21,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:49:21,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:49:21,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:49:21,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:49:21,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:49:21,073 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:49:21,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:49:21,073 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:49:21,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:49:21,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:49:21,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:49:21,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:49:21,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:21,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:49:21,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:49:21,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:49:21,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:49:21,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:49:21,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:49:21,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:49:21,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:49:21,075 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 -> 851dc7d49dcc9fde277beeb190c3ab252014728a3bd4281f423bffd927fb4430 [2022-02-20 18:49:21,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:49:21,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:49:21,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:49:21,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:49:21,241 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:49:21,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:21,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081b8b342/4536fc4f0847455fb1c4c6e93eed2dff/FLAGbe3ec330a [2022-02-20 18:49:21,675 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:49:21,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:21,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081b8b342/4536fc4f0847455fb1c4c6e93eed2dff/FLAGbe3ec330a [2022-02-20 18:49:21,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081b8b342/4536fc4f0847455fb1c4c6e93eed2dff [2022-02-20 18:49:21,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:49:21,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:49:21,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:21,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:49:21,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:49:21,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:21" (1/1) ... [2022-02-20 18:49:21,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f342ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:21, skipping insertion in model container [2022-02-20 18:49:21,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:21" (1/1) ... [2022-02-20 18:49:21,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:49:21,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:49:21,942 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-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2022-02-20 18:49:22,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:22,014 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:49:22,057 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-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9868,9881] [2022-02-20 18:49:22,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:22,109 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:49:22,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22 WrapperNode [2022-02-20 18:49:22,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:22,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:22,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:49:22,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:49:22,122 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:49:22" (1/1) ... [2022-02-20 18:49:22,132 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:49:22" (1/1) ... [2022-02-20 18:49:22,175 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 946 [2022-02-20 18:49:22,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:22,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:49:22,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:49:22,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:49:22,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:49:22,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:49:22,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:49:22,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:49:22,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (1/1) ... [2022-02-20 18:49:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:22,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:49:22,256 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:49:22,278 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:49:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:49:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:49:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:49:22,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:49:22,399 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:49:22,400 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:49:23,057 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:49:23,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:49:23,065 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:49:23,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:23 BoogieIcfgContainer [2022-02-20 18:49:23,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:49:23,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:49:23,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:49:23,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:49:23,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:49:21" (1/3) ... [2022-02-20 18:49:23,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a8f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:23, skipping insertion in model container [2022-02-20 18:49:23,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:22" (2/3) ... [2022-02-20 18:49:23,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1a8f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:23, skipping insertion in model container [2022-02-20 18:49:23,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:23" (3/3) ... [2022-02-20 18:49:23,072 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:23,076 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:49:23,076 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:49:23,106 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:49:23,111 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:49:23,111 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:49:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 256 states have (on average 1.72265625) internal successors, (441), 257 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:23,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:49:23,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:23,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:23,136 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash -165426501, now seen corresponding path program 1 times [2022-02-20 18:49:23,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:23,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144331066] [2022-02-20 18:49:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:23,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#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(65, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_182618~0 := 0;~__return_182759~0 := 0;~__return_182977~0 := 0; {261#true} is VALID [2022-02-20 18:49:23,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~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_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {261#true} is VALID [2022-02-20 18:49:23,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume 0 == ~r1~0 % 256; {261#true} is VALID [2022-02-20 18:49:23,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {261#true} is VALID [2022-02-20 18:49:23,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} assume ~id1~0 >= 0; {261#true} is VALID [2022-02-20 18:49:23,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {261#true} assume 0 == ~st1~0; {263#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:23,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {263#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:23,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {263#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:23,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(<= ~st1~0 0)} assume ~id2~0 >= 0; {263#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:23,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(<= ~st1~0 0)} assume 0 == ~st2~0; {264#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {264#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {264#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {264#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {264#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {264#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {265#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {266#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:23,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {267#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182618~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive1~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~id1~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive2~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive3~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive4~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,606 INFO L290 TraceCheckUtils]: 58: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive5~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,608 INFO L290 TraceCheckUtils]: 62: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,609 INFO L290 TraceCheckUtils]: 64: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive6~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,611 INFO L290 TraceCheckUtils]: 67: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,612 INFO L290 TraceCheckUtils]: 68: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,612 INFO L290 TraceCheckUtils]: 69: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_182759~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182759~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; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,613 INFO L290 TraceCheckUtils]: 70: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode1~0 % 256); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,614 INFO L290 TraceCheckUtils]: 72: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,614 INFO L290 TraceCheckUtils]: 73: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,615 INFO L290 TraceCheckUtils]: 75: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,617 INFO L290 TraceCheckUtils]: 78: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,618 INFO L290 TraceCheckUtils]: 79: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,620 INFO L290 TraceCheckUtils]: 80: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,620 INFO L290 TraceCheckUtils]: 81: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,621 INFO L290 TraceCheckUtils]: 82: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,621 INFO L290 TraceCheckUtils]: 83: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,622 INFO L290 TraceCheckUtils]: 84: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,622 INFO L290 TraceCheckUtils]: 85: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,623 INFO L290 TraceCheckUtils]: 87: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node6__m6~1#1 != ~nomsg~0); {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,628 INFO L290 TraceCheckUtils]: 90: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 0; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,628 INFO L290 TraceCheckUtils]: 91: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:23,629 INFO L290 TraceCheckUtils]: 92: Hoare triple {268#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~1#1 := 0; {262#false} is VALID [2022-02-20 18:49:23,629 INFO L290 TraceCheckUtils]: 93: Hoare triple {262#false} ~__return_182977~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_182977~0;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; {262#false} is VALID [2022-02-20 18:49:23,629 INFO L290 TraceCheckUtils]: 94: Hoare triple {262#false} assume 0 == main_~assert__arg~1#1 % 256; {262#false} is VALID [2022-02-20 18:49:23,630 INFO L290 TraceCheckUtils]: 95: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 18:49:23,632 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:49:23,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:23,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144331066] [2022-02-20 18:49:23,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144331066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:23,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:23,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:23,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004366250] [2022-02-20 18:49:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:49:23,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:23,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:23,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:23,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:23,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:23,745 INFO L87 Difference]: Start difference. First operand has 258 states, 256 states have (on average 1.72265625) internal successors, (441), 257 states have internal predecessors, (441), 0 states have call successors, (0), 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 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:27,186 INFO L93 Difference]: Finished difference Result 1163 states and 1886 transitions. [2022-02-20 18:49:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:49:27,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2022-02-20 18:49:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1886 transitions. [2022-02-20 18:49:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1886 transitions. [2022-02-20 18:49:27,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1886 transitions. [2022-02-20 18:49:28,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1886 edges. 1886 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:28,560 INFO L225 Difference]: With dead ends: 1163 [2022-02-20 18:49:28,560 INFO L226 Difference]: Without dead ends: 1022 [2022-02-20 18:49:28,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:49:28,565 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 3878 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3878 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:28,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3878 Valid, 3983 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-02-20 18:49:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 395. [2022-02-20 18:49:28,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:28,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1022 states. Second operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:28,779 INFO L74 IsIncluded]: Start isIncluded. First operand 1022 states. Second operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:28,780 INFO L87 Difference]: Start difference. First operand 1022 states. Second operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:28,823 INFO L93 Difference]: Finished difference Result 1022 states and 1594 transitions. [2022-02-20 18:49:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1594 transitions. [2022-02-20 18:49:28,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:28,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:28,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 0 states have call successors, (0), 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 1022 states. [2022-02-20 18:49:28,829 INFO L87 Difference]: Start difference. First operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 0 states have call successors, (0), 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 1022 states. [2022-02-20 18:49:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:28,882 INFO L93 Difference]: Finished difference Result 1022 states and 1594 transitions. [2022-02-20 18:49:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1594 transitions. [2022-02-20 18:49:28,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:28,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:28,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:28,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.5076142131979695) internal successors, (594), 394 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 594 transitions. [2022-02-20 18:49:28,895 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 594 transitions. Word has length 96 [2022-02-20 18:49:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:28,896 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 594 transitions. [2022-02-20 18:49:28,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 594 transitions. [2022-02-20 18:49:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:49:28,898 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:28,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:49:28,898 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:28,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1176866191, now seen corresponding path program 1 times [2022-02-20 18:49:28,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:28,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969432851] [2022-02-20 18:49:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:29,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {4398#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(65, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_182618~0 := 0;~__return_182759~0 := 0;~__return_182977~0 := 0; {4398#true} is VALID [2022-02-20 18:49:29,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {4398#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_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~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_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {4398#true} is VALID [2022-02-20 18:49:29,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {4398#true} assume 0 == ~r1~0 % 256; {4398#true} is VALID [2022-02-20 18:49:29,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {4398#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id6~0 >= 0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st6~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send6~0 == ~id6~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode6~0 % 256; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id6~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id6~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id6~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id6~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182618~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,160 INFO L290 TraceCheckUtils]: 43: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:49:29,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {4400#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:29,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(~send1~0 != ~id1~0); {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:29,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:29,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:49:29,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {4401#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:29,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:29,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:29,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:49:29,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {4402#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:29,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:29,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:29,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:29,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {4403#(<= (+ (* 256 (div ~alive6~0 256)) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:29,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !(~send4~0 != ~id4~0); {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:29,181 INFO L290 TraceCheckUtils]: 59: Hoare triple {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:29,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~mode5~0 % 256); {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:29,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {4404#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~alive5~0 % 256); {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:29,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !(~send5~0 != ~id5~0); {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:29,182 INFO L290 TraceCheckUtils]: 63: Hoare triple {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:29,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~mode6~0 % 256); {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:29,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {4405#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~alive6~0 % 256); {4399#false} is VALID [2022-02-20 18:49:29,183 INFO L290 TraceCheckUtils]: 66: Hoare triple {4399#false} assume !(~send6~0 != ~id6~0); {4399#false} is VALID [2022-02-20 18:49:29,183 INFO L290 TraceCheckUtils]: 67: Hoare triple {4399#false} ~mode6~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4399#false} is VALID [2022-02-20 18:49:29,183 INFO L290 TraceCheckUtils]: 68: Hoare triple {4399#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {4399#false} is VALID [2022-02-20 18:49:29,183 INFO L290 TraceCheckUtils]: 69: Hoare triple {4399#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_182759~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182759~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; {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {4399#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 71: Hoare triple {4399#false} assume !(0 == ~mode1~0 % 256); {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 72: Hoare triple {4399#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 73: Hoare triple {4399#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 74: Hoare triple {4399#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 75: Hoare triple {4399#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 76: Hoare triple {4399#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 77: Hoare triple {4399#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {4399#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {4399#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4399#false} is VALID [2022-02-20 18:49:29,184 INFO L290 TraceCheckUtils]: 80: Hoare triple {4399#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 81: Hoare triple {4399#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 82: Hoare triple {4399#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 83: Hoare triple {4399#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {4399#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 85: Hoare triple {4399#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 86: Hoare triple {4399#false} ~mode5~0 := 0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 87: Hoare triple {4399#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 88: Hoare triple {4399#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {4399#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 90: Hoare triple {4399#false} ~mode6~0 := 0; {4399#false} is VALID [2022-02-20 18:49:29,185 INFO L290 TraceCheckUtils]: 91: Hoare triple {4399#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {4399#false} is VALID [2022-02-20 18:49:29,186 INFO L290 TraceCheckUtils]: 92: Hoare triple {4399#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {4399#false} is VALID [2022-02-20 18:49:29,186 INFO L290 TraceCheckUtils]: 93: Hoare triple {4399#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {4399#false} is VALID [2022-02-20 18:49:29,186 INFO L290 TraceCheckUtils]: 94: Hoare triple {4399#false} ~__return_182977~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_182977~0;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; {4399#false} is VALID [2022-02-20 18:49:29,186 INFO L290 TraceCheckUtils]: 95: Hoare triple {4399#false} assume 0 == main_~assert__arg~1#1 % 256; {4399#false} is VALID [2022-02-20 18:49:29,186 INFO L290 TraceCheckUtils]: 96: Hoare triple {4399#false} assume !false; {4399#false} is VALID [2022-02-20 18:49:29,187 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:49:29,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:29,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969432851] [2022-02-20 18:49:29,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969432851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:29,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:29,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:29,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074963542] [2022-02-20 18:49:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:29,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:49:29,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:29,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:29,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:29,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:29,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:29,271 INFO L87 Difference]: Start difference. First operand 395 states and 594 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:32,876 INFO L93 Difference]: Finished difference Result 1972 states and 3070 transitions. [2022-02-20 18:49:32,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:49:32,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2022-02-20 18:49:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1733 transitions. [2022-02-20 18:49:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1733 transitions. [2022-02-20 18:49:32,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1733 transitions. [2022-02-20 18:49:34,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1733 edges. 1733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:34,253 INFO L225 Difference]: With dead ends: 1972 [2022-02-20 18:49:34,253 INFO L226 Difference]: Without dead ends: 1676 [2022-02-20 18:49:34,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:34,256 INFO L933 BasicCegarLoop]: 750 mSDtfsCounter, 2228 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:34,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2228 Valid, 1885 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:49:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-02-20 18:49:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1666. [2022-02-20 18:49:35,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:35,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1676 states. Second operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,395 INFO L74 IsIncluded]: Start isIncluded. First operand 1676 states. Second operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,398 INFO L87 Difference]: Start difference. First operand 1676 states. Second operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:35,484 INFO L93 Difference]: Finished difference Result 1676 states and 2592 transitions. [2022-02-20 18:49:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2592 transitions. [2022-02-20 18:49:35,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:35,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:35,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 0 states have call successors, (0), 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 1676 states. [2022-02-20 18:49:35,493 INFO L87 Difference]: Start difference. First operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 0 states have call successors, (0), 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 1676 states. [2022-02-20 18:49:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:35,582 INFO L93 Difference]: Finished difference Result 1676 states and 2592 transitions. [2022-02-20 18:49:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2592 transitions. [2022-02-20 18:49:35,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:35,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:35,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:35,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.5537537537537538) internal successors, (2587), 1665 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2587 transitions. [2022-02-20 18:49:35,711 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2587 transitions. Word has length 97 [2022-02-20 18:49:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:35,712 INFO L470 AbstractCegarLoop]: Abstraction has 1666 states and 2587 transitions. [2022-02-20 18:49:35,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2587 transitions. [2022-02-20 18:49:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:49:35,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:35,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:49:35,715 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1298319018, now seen corresponding path program 1 times [2022-02-20 18:49:35,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:35,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811897855] [2022-02-20 18:49:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:35,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:35,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {12610#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(65, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_182618~0 := 0;~__return_182759~0 := 0;~__return_182977~0 := 0; {12612#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:35,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {12612#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~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_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {12612#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:35,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {12612#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {12612#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:35,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {12612#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {12612#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:35,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {12612#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {12613#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:49:35,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {12613#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {12613#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:49:35,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {12613#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id6~0 >= 0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st6~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send6~0 == ~id6~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode6~0 % 256; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id6~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,842 INFO L290 TraceCheckUtils]: 35: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id6~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id6~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,844 INFO L290 TraceCheckUtils]: 41: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id6~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182618~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12614#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:49:35,846 INFO L290 TraceCheckUtils]: 46: Hoare triple {12614#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {12611#false} is VALID [2022-02-20 18:49:35,846 INFO L290 TraceCheckUtils]: 47: Hoare triple {12611#false} ~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); {12611#false} is VALID [2022-02-20 18:49:35,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {12611#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {12611#false} assume !!(0 == ~mode2~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {12611#false} assume !!(0 == ~alive2~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {12611#false} assume !(~send2~0 != ~id2~0); {12611#false} is VALID [2022-02-20 18:49:35,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {12611#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {12611#false} assume !!(0 == ~mode3~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {12611#false} assume !!(0 == ~alive3~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {12611#false} assume !(~send3~0 != ~id3~0); {12611#false} is VALID [2022-02-20 18:49:35,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {12611#false} assume !!(0 == ~mode4~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {12611#false} assume !!(0 == ~alive4~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {12611#false} assume !(~send4~0 != ~id4~0); {12611#false} is VALID [2022-02-20 18:49:35,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {12611#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {12611#false} assume !!(0 == ~mode5~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {12611#false} assume !!(0 == ~alive5~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {12611#false} assume !(~send5~0 != ~id5~0); {12611#false} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {12611#false} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {12611#false} assume !!(0 == ~mode6~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {12611#false} assume !!(0 == ~alive6~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {12611#false} assume !(~send6~0 != ~id6~0); {12611#false} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {12611#false} ~mode6~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12611#false} is VALID [2022-02-20 18:49:35,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {12611#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {12611#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_182759~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182759~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; {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {12611#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {12611#false} assume !(0 == ~mode1~0 % 256); {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {12611#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {12611#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 75: Hoare triple {12611#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 76: Hoare triple {12611#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {12611#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {12611#false} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 78: Hoare triple {12611#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {12611#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {12611#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {12611#false} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {12611#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 82: Hoare triple {12611#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 83: Hoare triple {12611#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {12611#false} is VALID [2022-02-20 18:49:35,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {12611#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {12611#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {12611#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {12611#false} is VALID [2022-02-20 18:49:35,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {12611#false} ~mode5~0 := 0; {12611#false} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 88: Hoare triple {12611#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {12611#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12611#false} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 90: Hoare triple {12611#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {12611#false} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 91: Hoare triple {12611#false} ~mode6~0 := 0; {12611#false} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 92: Hoare triple {12611#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {12611#false} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 93: Hoare triple {12611#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12611#false} is VALID [2022-02-20 18:49:35,864 INFO L290 TraceCheckUtils]: 94: Hoare triple {12611#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {12611#false} is VALID [2022-02-20 18:49:35,865 INFO L290 TraceCheckUtils]: 95: Hoare triple {12611#false} ~__return_182977~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_182977~0;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; {12611#false} is VALID [2022-02-20 18:49:35,865 INFO L290 TraceCheckUtils]: 96: Hoare triple {12611#false} assume 0 == main_~assert__arg~1#1 % 256; {12611#false} is VALID [2022-02-20 18:49:35,865 INFO L290 TraceCheckUtils]: 97: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-02-20 18:49:35,867 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:49:35,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:35,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811897855] [2022-02-20 18:49:35,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811897855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:35,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:35,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:35,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12979842] [2022-02-20 18:49:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 18:49:35,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:35,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:35,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:35,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:35,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:35,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:35,937 INFO L87 Difference]: Start difference. First operand 1666 states and 2587 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:40,453 INFO L93 Difference]: Finished difference Result 4636 states and 7277 transitions. [2022-02-20 18:49:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 18:49:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 911 transitions. [2022-02-20 18:49:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 911 transitions. [2022-02-20 18:49:40,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 911 transitions. [2022-02-20 18:49:41,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 911 edges. 911 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:41,368 INFO L225 Difference]: With dead ends: 4636 [2022-02-20 18:49:41,369 INFO L226 Difference]: Without dead ends: 3021 [2022-02-20 18:49:41,370 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:49:41,371 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 1477 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:41,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 355 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2022-02-20 18:49:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 3019. [2022-02-20 18:49:44,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:44,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3021 states. Second operand has 3019 states, 3018 states have (on average 1.563949635520212) internal successors, (4720), 3018 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:44,409 INFO L74 IsIncluded]: Start isIncluded. First operand 3021 states. Second operand has 3019 states, 3018 states have (on average 1.563949635520212) internal successors, (4720), 3018 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:44,414 INFO L87 Difference]: Start difference. First operand 3021 states. Second operand has 3019 states, 3018 states have (on average 1.563949635520212) internal successors, (4720), 3018 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:44,659 INFO L93 Difference]: Finished difference Result 3021 states and 4721 transitions. [2022-02-20 18:49:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4721 transitions. [2022-02-20 18:49:44,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:44,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:44,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 3019 states, 3018 states have (on average 1.563949635520212) internal successors, (4720), 3018 states have internal predecessors, (4720), 0 states have call successors, (0), 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 3021 states. [2022-02-20 18:49:44,674 INFO L87 Difference]: Start difference. First operand has 3019 states, 3018 states have (on average 1.563949635520212) internal successors, (4720), 3018 states have internal predecessors, (4720), 0 states have call successors, (0), 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 3021 states. [2022-02-20 18:49:44,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:44,921 INFO L93 Difference]: Finished difference Result 3021 states and 4721 transitions. [2022-02-20 18:49:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4721 transitions. [2022-02-20 18:49:44,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:44,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:44,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:44,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 3018 states have (on average 1.563949635520212) internal successors, (4720), 3018 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4720 transitions. [2022-02-20 18:49:45,289 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4720 transitions. Word has length 98 [2022-02-20 18:49:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:45,290 INFO L470 AbstractCegarLoop]: Abstraction has 3019 states and 4720 transitions. [2022-02-20 18:49:45,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4720 transitions. [2022-02-20 18:49:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:49:45,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:45,292 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:49:45,293 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2114426094, now seen corresponding path program 1 times [2022-02-20 18:49:45,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:45,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125848692] [2022-02-20 18:49:45,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:45,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {28974#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(65, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_182618~0 := 0;~__return_182759~0 := 0;~__return_182977~0 := 0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~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_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {28976#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:45,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {28976#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {28977#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:49:45,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {28977#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {28977#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:49:45,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {28977#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id6~0 >= 0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~st6~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send6~0 == ~id6~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode6~0 % 256; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id6~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id6~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id6~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id6~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182618~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive1~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send1~0 != ~id1~0); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive2~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~id2~0); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive3~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~id3~0); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,389 INFO L290 TraceCheckUtils]: 55: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive4~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~id4~0); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256); {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(0 == ~alive5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {28978#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:45,391 INFO L290 TraceCheckUtils]: 62: Hoare triple {28978#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {28975#false} is VALID [2022-02-20 18:49:45,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {28975#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256); {28975#false} is VALID [2022-02-20 18:49:45,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {28975#false} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,392 INFO L290 TraceCheckUtils]: 65: Hoare triple {28975#false} assume !!(0 == ~mode6~0 % 256); {28975#false} is VALID [2022-02-20 18:49:45,392 INFO L290 TraceCheckUtils]: 66: Hoare triple {28975#false} assume !!(0 == ~alive6~0 % 256); {28975#false} is VALID [2022-02-20 18:49:45,392 INFO L290 TraceCheckUtils]: 67: Hoare triple {28975#false} assume !(~send6~0 != ~id6~0); {28975#false} is VALID [2022-02-20 18:49:45,392 INFO L290 TraceCheckUtils]: 68: Hoare triple {28975#false} ~mode6~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {28975#false} is VALID [2022-02-20 18:49:45,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {28975#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {28975#false} is VALID [2022-02-20 18:49:45,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {28975#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_182759~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182759~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; {28975#false} is VALID [2022-02-20 18:49:45,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {28975#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {28975#false} assume !(0 == ~mode1~0 % 256); {28975#false} is VALID [2022-02-20 18:49:45,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {28975#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {28975#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {28975#false} is VALID [2022-02-20 18:49:45,393 INFO L290 TraceCheckUtils]: 75: Hoare triple {28975#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,393 INFO L290 TraceCheckUtils]: 76: Hoare triple {28975#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,393 INFO L290 TraceCheckUtils]: 77: Hoare triple {28975#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {28975#false} is VALID [2022-02-20 18:49:45,394 INFO L290 TraceCheckUtils]: 78: Hoare triple {28975#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {28975#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,395 INFO L290 TraceCheckUtils]: 80: Hoare triple {28975#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {28975#false} is VALID [2022-02-20 18:49:45,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {28975#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,397 INFO L290 TraceCheckUtils]: 82: Hoare triple {28975#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,398 INFO L290 TraceCheckUtils]: 83: Hoare triple {28975#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {28975#false} is VALID [2022-02-20 18:49:45,398 INFO L290 TraceCheckUtils]: 84: Hoare triple {28975#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,398 INFO L290 TraceCheckUtils]: 85: Hoare triple {28975#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,398 INFO L290 TraceCheckUtils]: 86: Hoare triple {28975#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {28975#false} is VALID [2022-02-20 18:49:45,398 INFO L290 TraceCheckUtils]: 87: Hoare triple {28975#false} ~mode5~0 := 0; {28975#false} is VALID [2022-02-20 18:49:45,398 INFO L290 TraceCheckUtils]: 88: Hoare triple {28975#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,399 INFO L290 TraceCheckUtils]: 89: Hoare triple {28975#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {28975#false} is VALID [2022-02-20 18:49:45,399 INFO L290 TraceCheckUtils]: 90: Hoare triple {28975#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {28975#false} is VALID [2022-02-20 18:49:45,399 INFO L290 TraceCheckUtils]: 91: Hoare triple {28975#false} ~mode6~0 := 0; {28975#false} is VALID [2022-02-20 18:49:45,399 INFO L290 TraceCheckUtils]: 92: Hoare triple {28975#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {28975#false} is VALID [2022-02-20 18:49:45,399 INFO L290 TraceCheckUtils]: 93: Hoare triple {28975#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {28975#false} is VALID [2022-02-20 18:49:45,399 INFO L290 TraceCheckUtils]: 94: Hoare triple {28975#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {28975#false} is VALID [2022-02-20 18:49:45,400 INFO L290 TraceCheckUtils]: 95: Hoare triple {28975#false} ~__return_182977~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_182977~0;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; {28975#false} is VALID [2022-02-20 18:49:45,400 INFO L290 TraceCheckUtils]: 96: Hoare triple {28975#false} assume 0 == main_~assert__arg~1#1 % 256; {28975#false} is VALID [2022-02-20 18:49:45,400 INFO L290 TraceCheckUtils]: 97: Hoare triple {28975#false} assume !false; {28975#false} is VALID [2022-02-20 18:49:45,401 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:49:45,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:45,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125848692] [2022-02-20 18:49:45,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125848692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:45,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:45,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:45,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22282793] [2022-02-20 18:49:45,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:45,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 18:49:45,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:45,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:45,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:45,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:45,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:45,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:45,458 INFO L87 Difference]: Start difference. First operand 3019 states and 4720 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:55,358 INFO L93 Difference]: Finished difference Result 8182 states and 12873 transitions. [2022-02-20 18:49:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:55,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 18:49:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 813 transitions. [2022-02-20 18:49:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 813 transitions. [2022-02-20 18:49:55,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 813 transitions. [2022-02-20 18:49:55,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 813 edges. 813 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:56,943 INFO L225 Difference]: With dead ends: 8182 [2022-02-20 18:49:56,943 INFO L226 Difference]: Without dead ends: 5320 [2022-02-20 18:49:56,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:49:56,947 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 1349 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:56,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1349 Valid, 363 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2022-02-20 18:50:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5318. [2022-02-20 18:50:03,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:03,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5320 states. Second operand has 5318 states, 5317 states have (on average 1.5653564039872108) internal successors, (8323), 5317 states have internal predecessors, (8323), 0 states have call successors, (0), 0 states have call 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:03,538 INFO L74 IsIncluded]: Start isIncluded. First operand 5320 states. Second operand has 5318 states, 5317 states have (on average 1.5653564039872108) internal successors, (8323), 5317 states have internal predecessors, (8323), 0 states have call successors, (0), 0 states have call 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:03,543 INFO L87 Difference]: Start difference. First operand 5320 states. Second operand has 5318 states, 5317 states have (on average 1.5653564039872108) internal successors, (8323), 5317 states have internal predecessors, (8323), 0 states have call successors, (0), 0 states have call 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:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:04,300 INFO L93 Difference]: Finished difference Result 5320 states and 8324 transitions. [2022-02-20 18:50:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8324 transitions. [2022-02-20 18:50:04,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:04,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:04,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 5318 states, 5317 states have (on average 1.5653564039872108) internal successors, (8323), 5317 states have internal predecessors, (8323), 0 states have call successors, (0), 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 5320 states. [2022-02-20 18:50:04,320 INFO L87 Difference]: Start difference. First operand has 5318 states, 5317 states have (on average 1.5653564039872108) internal successors, (8323), 5317 states have internal predecessors, (8323), 0 states have call successors, (0), 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 5320 states. [2022-02-20 18:50:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:05,102 INFO L93 Difference]: Finished difference Result 5320 states and 8324 transitions. [2022-02-20 18:50:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8324 transitions. [2022-02-20 18:50:05,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:05,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:05,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:05,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 5317 states have (on average 1.5653564039872108) internal successors, (8323), 5317 states have internal predecessors, (8323), 0 states have call successors, (0), 0 states have call 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:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 8323 transitions. [2022-02-20 18:50:06,238 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 8323 transitions. Word has length 98 [2022-02-20 18:50:06,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:06,239 INFO L470 AbstractCegarLoop]: Abstraction has 5318 states and 8323 transitions. [2022-02-20 18:50:06,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 8323 transitions. [2022-02-20 18:50:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:50:06,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:06,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:06,243 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash -280718047, now seen corresponding path program 1 times [2022-02-20 18:50:06,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:06,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446457973] [2022-02-20 18:50:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:06,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {58061#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(65, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_182618~0 := 0;~__return_182759~0 := 0;~__return_182977~0 := 0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node6____CPAchecker_TMP_0~1#1, main_~node6____CPAchecker_TMP_1~0#1, main_~node6__m6~1#1, main_~node5__m5~1#1, main_~node4__m4~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_~node6____CPAchecker_TMP_0~0#1, main_~node6____CPAchecker_TMP_1~1#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;havoc main_~init__tmp~0#1; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st5~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~send5~0 == ~id5~0; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode5~0 % 256; {58063#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:06,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {58063#(<= (+ ~nomsg~0 1) 0)} assume ~id6~0 >= 0; {58064#(<= (+ ~nomsg~0 1) ~id6~0)} is VALID [2022-02-20 18:50:06,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {58064#(<= (+ ~nomsg~0 1) ~id6~0)} assume 0 == ~st6~0; {58064#(<= (+ ~nomsg~0 1) ~id6~0)} is VALID [2022-02-20 18:50:06,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {58064#(<= (+ ~nomsg~0 1) ~id6~0)} assume ~send6~0 == ~id6~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume 0 == ~mode6~0 % 256; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id2~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id3~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id4~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id5~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id6~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id3~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id4~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id5~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id6~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id4~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id5~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id6~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id4~0 != ~id5~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id4~0 != ~id6~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_182618~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_182618~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode1~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive1~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send1~0 != ~id1~0); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode2~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive2~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send2~0 != ~id2~0); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,334 INFO L290 TraceCheckUtils]: 51: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode3~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive3~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,335 INFO L290 TraceCheckUtils]: 54: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send3~0 != ~id3~0); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode4~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive4~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send4~0 != ~id4~0); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode5~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive5~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send5~0 != ~id5~0); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode6~0 % 256); {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(0 == ~alive6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {58065#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:06,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {58065#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send6~0 != ~nomsg~0);main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {58062#false} is VALID [2022-02-20 18:50:06,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {58062#false} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256); {58062#false} is VALID [2022-02-20 18:50:06,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {58062#false} ~mode6~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {58062#false} is VALID [2022-02-20 18:50:06,338 INFO L290 TraceCheckUtils]: 69: Hoare triple {58062#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {58062#false} is VALID [2022-02-20 18:50:06,338 INFO L290 TraceCheckUtils]: 70: Hoare triple {58062#false} assume ~r1~0 % 256 < 6;main_~check__tmp~0#1 := 1;~__return_182759~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_182759~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; {58062#false} is VALID [2022-02-20 18:50:06,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {58062#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {58062#false} assume !(0 == ~mode1~0 % 256); {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {58062#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {58062#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {58062#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 76: Hoare triple {58062#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {58062#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 78: Hoare triple {58062#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 79: Hoare triple {58062#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,339 INFO L290 TraceCheckUtils]: 80: Hoare triple {58062#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 81: Hoare triple {58062#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 82: Hoare triple {58062#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 83: Hoare triple {58062#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 84: Hoare triple {58062#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 85: Hoare triple {58062#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 86: Hoare triple {58062#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 87: Hoare triple {58062#false} ~mode5~0 := 0; {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 88: Hoare triple {58062#false} havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,340 INFO L290 TraceCheckUtils]: 89: Hoare triple {58062#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 90: Hoare triple {58062#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 91: Hoare triple {58062#false} ~mode6~0 := 0; {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 92: Hoare triple {58062#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 93: Hoare triple {58062#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 94: Hoare triple {58062#false} assume ~r1~0 % 256 < 6;main_~check__tmp~1#1 := 1; {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {58062#false} ~__return_182977~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_182977~0;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; {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {58062#false} assume 0 == main_~assert__arg~1#1 % 256; {58062#false} is VALID [2022-02-20 18:50:06,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {58062#false} assume !false; {58062#false} is VALID [2022-02-20 18:50:06,342 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:06,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:06,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446457973] [2022-02-20 18:50:06,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446457973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:06,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:06,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:06,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443139770] [2022-02-20 18:50:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2022-02-20 18:50:06,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:06,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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:06,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:06,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:06,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:06,398 INFO L87 Difference]: Start difference. First operand 5318 states and 8323 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)