./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.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.2.ufo.BOUNDED-12.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 35eb4fe61244b47e62120cf84d8eaed931ae7a7b0a5140717764703691b11b75 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:49:26,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:49:26,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:49:27,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:49:27,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:49:27,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:49:27,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:49:27,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:49:27,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:49:27,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:49:27,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:49:27,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:49:27,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:49:27,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:49:27,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:49:27,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:49:27,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:49:27,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:49:27,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:49:27,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:49:27,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:49:27,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:49:27,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:49:27,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:49:27,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:49:27,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:49:27,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:49:27,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:49:27,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:49:27,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:49:27,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:49:27,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:49:27,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:49:27,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:49:27,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:49:27,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:49:27,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:49:27,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:49:27,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:49:27,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:49:27,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:49:27,067 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:27,086 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:49:27,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:49:27,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:49:27,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:49:27,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:49:27,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:49:27,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:49:27,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:49:27,090 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:49:27,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:49:27,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:49:27,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:49:27,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:49:27,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:49:27,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:49:27,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:49:27,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:49:27,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:27,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:49:27,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:49:27,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:49:27,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:49:27,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:49:27,094 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:49:27,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:49:27,095 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:49:27,095 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 -> 35eb4fe61244b47e62120cf84d8eaed931ae7a7b0a5140717764703691b11b75 [2022-02-20 18:49:27,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:49:27,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:49:27,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:49:27,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:49:27,333 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:49:27,334 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.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2022-02-20 18:49:27,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a987adea5/c43554e793fe4ed785767405d829702a/FLAG9116a88ea [2022-02-20 18:49:27,798 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:49:27,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2022-02-20 18:49:27,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a987adea5/c43554e793fe4ed785767405d829702a/FLAG9116a88ea [2022-02-20 18:49:28,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a987adea5/c43554e793fe4ed785767405d829702a [2022-02-20 18:49:28,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:49:28,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:49:28,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:28,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:49:28,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:49:28,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:28" (1/1) ... [2022-02-20 18:49:28,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460f18fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:28, skipping insertion in model container [2022-02-20 18:49:28,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:28" (1/1) ... [2022-02-20 18:49:28,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:49:28,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:49:28,436 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.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2022-02-20 18:49:28,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:28,525 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:49:28,608 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.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2022-02-20 18:49:28,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:28,672 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:49:28,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:28 WrapperNode [2022-02-20 18:49:28,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:28,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:28,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:49:28,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:49:28,679 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:28" (1/1) ... [2022-02-20 18:49:28,689 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:28" (1/1) ... [2022-02-20 18:49:28,735 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 933 [2022-02-20 18:49:28,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:28,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:49:28,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:49:28,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:49:28,742 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:28" (1/1) ... [2022-02-20 18:49:28,742 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:28" (1/1) ... [2022-02-20 18:49:28,745 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:28" (1/1) ... [2022-02-20 18:49:28,746 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:28" (1/1) ... [2022-02-20 18:49:28,754 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:28" (1/1) ... [2022-02-20 18:49:28,761 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:28" (1/1) ... [2022-02-20 18:49:28,763 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:28" (1/1) ... [2022-02-20 18:49:28,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:49:28,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:49:28,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:49:28,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:49:28,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:28" (1/1) ... [2022-02-20 18:49:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:28,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:49:28,799 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:28,801 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:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:49:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:49:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:49:28,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:49:28,934 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:49:28,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:49:29,662 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:49:29,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:49:29,671 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:49:29,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:29 BoogieIcfgContainer [2022-02-20 18:49:29,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:49:29,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:49:29,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:49:29,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:49:29,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:49:28" (1/3) ... [2022-02-20 18:49:29,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a51df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:29, skipping insertion in model container [2022-02-20 18:49:29,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:28" (2/3) ... [2022-02-20 18:49:29,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a51df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:29, skipping insertion in model container [2022-02-20 18:49:29,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:29" (3/3) ... [2022-02-20 18:49:29,681 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2022-02-20 18:49:29,694 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:49:29,694 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:49:29,731 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:49:29,737 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:29,737 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:49:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 250 states, 248 states have (on average 1.7258064516129032) internal successors, (428), 249 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call 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,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:49:29,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:29,784 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:29,784 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 680840216, now seen corresponding path program 1 times [2022-02-20 18:49:29,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:29,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391713613] [2022-02-20 18:49:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:30,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {253#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(66, 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_104960~0 := 0;~__return_105100~0 := 0;~__tmp_105291_0~0 := 0;~__return_105325~0 := 0;~__return_105220~0 := 0; {253#true} is VALID [2022-02-20 18:49:30,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {253#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__m1~2#1, main_~main____CPAchecker_TMP_0~1#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_~main____CPAchecker_TMP_0~0#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__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {253#true} is VALID [2022-02-20 18:49:30,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#true} assume 0 == ~r1~0; {253#true} is VALID [2022-02-20 18:49:30,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {253#true} is VALID [2022-02-20 18:49:30,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#true} assume ~id1~0 >= 0; {253#true} is VALID [2022-02-20 18:49:30,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#true} assume 0 == ~st1~0; {255#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:30,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {255#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:30,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {255#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:30,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#(<= ~st1~0 0)} assume ~id2~0 >= 0; {255#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:30,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#(<= ~st1~0 0)} assume 0 == ~st2~0; {256#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {256#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {256#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {256#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {256#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {256#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {256#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {258#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:30,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {259#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {260#(<= (+ ~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_104960~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104960~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive1~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive2~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~id2~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,232 INFO L290 TraceCheckUtils]: 53: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive3~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~id3~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive4~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~id4~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive5~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~id5~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~alive6~0 % 256); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send6~0 != ~id6~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~r1~0 < 6;main_~check__tmp~0#1 := 1;~__return_105100~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105100~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,241 INFO L290 TraceCheckUtils]: 73: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,242 INFO L290 TraceCheckUtils]: 74: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,242 INFO L290 TraceCheckUtils]: 75: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,243 INFO L290 TraceCheckUtils]: 76: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,243 INFO L290 TraceCheckUtils]: 77: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,244 INFO L290 TraceCheckUtils]: 79: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,245 INFO L290 TraceCheckUtils]: 80: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,246 INFO L290 TraceCheckUtils]: 82: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,246 INFO L290 TraceCheckUtils]: 83: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,247 INFO L290 TraceCheckUtils]: 85: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,247 INFO L290 TraceCheckUtils]: 86: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode5~0 := 0;~__tmp_105291_0~0 := main_~main____CPAchecker_TMP_0~0#1; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,248 INFO L290 TraceCheckUtils]: 87: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_105291_0~0;havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,248 INFO L290 TraceCheckUtils]: 88: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,249 INFO L290 TraceCheckUtils]: 89: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(main_~node6__m6~1#1 != ~nomsg~0); {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,249 INFO L290 TraceCheckUtils]: 90: Hoare triple {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~mode6~0 := 0; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,250 INFO L290 TraceCheckUtils]: 91: Hoare triple {260#(<= (+ ~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; {260#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:49:30,250 INFO L290 TraceCheckUtils]: 92: Hoare triple {260#(<= (+ ~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; {254#false} is VALID [2022-02-20 18:49:30,250 INFO L290 TraceCheckUtils]: 93: Hoare triple {254#false} ~__return_105325~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105325~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; {254#false} is VALID [2022-02-20 18:49:30,251 INFO L290 TraceCheckUtils]: 94: Hoare triple {254#false} assume 0 == main_~assert__arg~1#1 % 256; {254#false} is VALID [2022-02-20 18:49:30,251 INFO L290 TraceCheckUtils]: 95: Hoare triple {254#false} assume !false; {254#false} is VALID [2022-02-20 18:49:30,252 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:30,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:30,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391713613] [2022-02-20 18:49:30,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391713613] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:30,253 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:30,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:30,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124896938] [2022-02-20 18:49:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:30,259 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:30,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:30,262 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:30,338 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:30,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:30,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:30,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:30,356 INFO L87 Difference]: Start difference. First operand has 250 states, 248 states have (on average 1.7258064516129032) internal successors, (428), 249 states have internal predecessors, (428), 0 states have call successors, (0), 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:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:33,745 INFO L93 Difference]: Finished difference Result 1120 states and 1817 transitions. [2022-02-20 18:49:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:49:33,745 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:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:33,746 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:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1817 transitions. [2022-02-20 18:49:33,763 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:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1817 transitions. [2022-02-20 18:49:33,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1817 transitions. [2022-02-20 18:49:34,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1817 edges. 1817 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:35,084 INFO L225 Difference]: With dead ends: 1120 [2022-02-20 18:49:35,085 INFO L226 Difference]: Without dead ends: 984 [2022-02-20 18:49:35,088 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:35,090 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 4180 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4180 SdHoareTripleChecker+Valid, 3700 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:35,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4180 Valid, 3700 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-02-20 18:49:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 382. [2022-02-20 18:49:35,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:35,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 984 states. Second operand has 382 states, 381 states have (on average 1.4986876640419948) internal successors, (571), 381 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call 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,290 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand has 382 states, 381 states have (on average 1.4986876640419948) internal successors, (571), 381 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call 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,291 INFO L87 Difference]: Start difference. First operand 984 states. Second operand has 382 states, 381 states have (on average 1.4986876640419948) internal successors, (571), 381 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call 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,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:35,328 INFO L93 Difference]: Finished difference Result 984 states and 1526 transitions. [2022-02-20 18:49:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1526 transitions. [2022-02-20 18:49:35,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:35,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:35,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 381 states have (on average 1.4986876640419948) internal successors, (571), 381 states have internal predecessors, (571), 0 states have call successors, (0), 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 984 states. [2022-02-20 18:49:35,332 INFO L87 Difference]: Start difference. First operand has 382 states, 381 states have (on average 1.4986876640419948) internal successors, (571), 381 states have internal predecessors, (571), 0 states have call successors, (0), 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 984 states. [2022-02-20 18:49:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:35,369 INFO L93 Difference]: Finished difference Result 984 states and 1526 transitions. [2022-02-20 18:49:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1526 transitions. [2022-02-20 18:49:35,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:35,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:35,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:35,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4986876640419948) internal successors, (571), 381 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call 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,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 571 transitions. [2022-02-20 18:49:35,382 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 571 transitions. Word has length 96 [2022-02-20 18:49:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:35,382 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 571 transitions. [2022-02-20 18:49:35,382 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:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 571 transitions. [2022-02-20 18:49:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:49:35,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:35,384 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:35,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:49:35,385 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -693931319, now seen corresponding path program 1 times [2022-02-20 18:49:35,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:35,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728869445] [2022-02-20 18:49:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:35,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {4236#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(66, 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_104960~0 := 0;~__return_105100~0 := 0;~__tmp_105291_0~0 := 0;~__return_105325~0 := 0;~__return_105220~0 := 0; {4236#true} is VALID [2022-02-20 18:49:35,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#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__m1~2#1, main_~main____CPAchecker_TMP_0~1#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_~main____CPAchecker_TMP_0~0#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__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {4236#true} is VALID [2022-02-20 18:49:35,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {4236#true} assume 0 == ~r1~0; {4236#true} is VALID [2022-02-20 18:49:35,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {4236#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {4238#(<= (+ (* 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:35,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {4238#(<= (+ (* 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_104960~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104960~0; {4238#(<= (+ (* 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:35,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {4238#(<= (+ (* 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; {4238#(<= (+ (* 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:35,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {4238#(<= (+ (* 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 main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4238#(<= (+ (* 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:35,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {4238#(<= (+ (* 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); {4238#(<= (+ (* 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:35,652 INFO L290 TraceCheckUtils]: 46: Hoare triple {4238#(<= (+ (* 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); {4239#(<= (+ (* 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:35,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {4239#(<= (+ (* 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; {4239#(<= (+ (* 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:35,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {4239#(<= (+ (* 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); {4239#(<= (+ (* 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:35,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {4239#(<= (+ (* 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); {4240#(<= (+ (* 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:35,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {4240#(<= (+ (* 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); {4240#(<= (+ (* 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:35,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {4240#(<= (+ (* 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; {4240#(<= (+ (* 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:35,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {4240#(<= (+ (* 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); {4240#(<= (+ (* 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:35,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {4240#(<= (+ (* 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); {4241#(<= (+ (* 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:35,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {4241#(<= (+ (* 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); {4241#(<= (+ (* 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:35,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {4241#(<= (+ (* 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; {4241#(<= (+ (* 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:35,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {4241#(<= (+ (* 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); {4241#(<= (+ (* 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:35,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {4241#(<= (+ (* 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); {4242#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:35,662 INFO L290 TraceCheckUtils]: 58: Hoare triple {4242#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !(~send4~0 != ~id4~0); {4242#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:35,663 INFO L290 TraceCheckUtils]: 59: Hoare triple {4242#(<= (+ (* 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; {4242#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:35,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {4242#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~mode5~0 % 256); {4242#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} is VALID [2022-02-20 18:49:35,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {4242#(<= (+ (* 256 (div ~alive6~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive6~0 ~alive5~0))} assume !!(0 == ~alive5~0 % 256); {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:35,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !(~send5~0 != ~id5~0); {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:35,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:35,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~mode6~0 % 256); {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} is VALID [2022-02-20 18:49:35,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {4243#(<= (+ (* 256 (div ~alive6~0 256)) 1) ~alive6~0)} assume !!(0 == ~alive6~0 % 256); {4237#false} is VALID [2022-02-20 18:49:35,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {4237#false} assume !(~send6~0 != ~id6~0); {4237#false} is VALID [2022-02-20 18:49:35,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {4237#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; {4237#false} is VALID [2022-02-20 18:49:35,666 INFO L290 TraceCheckUtils]: 68: Hoare triple {4237#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {4237#false} is VALID [2022-02-20 18:49:35,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {4237#false} assume ~r1~0 < 6;main_~check__tmp~0#1 := 1;~__return_105100~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105100~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; {4237#false} is VALID [2022-02-20 18:49:35,666 INFO L290 TraceCheckUtils]: 70: Hoare triple {4237#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {4237#false} is VALID [2022-02-20 18:49:35,666 INFO L290 TraceCheckUtils]: 71: Hoare triple {4237#false} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {4237#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {4237#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4237#false} is VALID [2022-02-20 18:49:35,666 INFO L290 TraceCheckUtils]: 74: Hoare triple {4237#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,667 INFO L290 TraceCheckUtils]: 75: Hoare triple {4237#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,667 INFO L290 TraceCheckUtils]: 76: Hoare triple {4237#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4237#false} is VALID [2022-02-20 18:49:35,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {4237#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {4237#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,667 INFO L290 TraceCheckUtils]: 79: Hoare triple {4237#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {4237#false} is VALID [2022-02-20 18:49:35,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {4237#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,668 INFO L290 TraceCheckUtils]: 81: Hoare triple {4237#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {4237#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {4237#false} is VALID [2022-02-20 18:49:35,668 INFO L290 TraceCheckUtils]: 83: Hoare triple {4237#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,668 INFO L290 TraceCheckUtils]: 84: Hoare triple {4237#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,668 INFO L290 TraceCheckUtils]: 85: Hoare triple {4237#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {4237#false} is VALID [2022-02-20 18:49:35,668 INFO L290 TraceCheckUtils]: 86: Hoare triple {4237#false} ~mode5~0 := 0;~__tmp_105291_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4237#false} is VALID [2022-02-20 18:49:35,668 INFO L290 TraceCheckUtils]: 87: Hoare triple {4237#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_105291_0~0;havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,669 INFO L290 TraceCheckUtils]: 88: Hoare triple {4237#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {4237#false} is VALID [2022-02-20 18:49:35,669 INFO L290 TraceCheckUtils]: 89: Hoare triple {4237#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {4237#false} is VALID [2022-02-20 18:49:35,669 INFO L290 TraceCheckUtils]: 90: Hoare triple {4237#false} ~mode6~0 := 0; {4237#false} is VALID [2022-02-20 18:49:35,669 INFO L290 TraceCheckUtils]: 91: Hoare triple {4237#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; {4237#false} is VALID [2022-02-20 18:49:35,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {4237#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {4237#false} is VALID [2022-02-20 18:49:35,669 INFO L290 TraceCheckUtils]: 93: Hoare triple {4237#false} assume ~r1~0 < 6;main_~check__tmp~1#1 := 1; {4237#false} is VALID [2022-02-20 18:49:35,670 INFO L290 TraceCheckUtils]: 94: Hoare triple {4237#false} ~__return_105325~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105325~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; {4237#false} is VALID [2022-02-20 18:49:35,670 INFO L290 TraceCheckUtils]: 95: Hoare triple {4237#false} assume 0 == main_~assert__arg~1#1 % 256; {4237#false} is VALID [2022-02-20 18:49:35,670 INFO L290 TraceCheckUtils]: 96: Hoare triple {4237#false} assume !false; {4237#false} is VALID [2022-02-20 18:49:35,671 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,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:35,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728869445] [2022-02-20 18:49:35,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728869445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:35,672 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:35,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:49:35,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465264680] [2022-02-20 18:49:35,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:35,673 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:35,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:35,674 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:35,749 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:35,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:49:35,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:35,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:49:35,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:49:35,750 INFO L87 Difference]: Start difference. First operand 382 states and 571 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:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:39,379 INFO L93 Difference]: Finished difference Result 1909 states and 2955 transitions. [2022-02-20 18:49:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:49:39,380 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:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:39,380 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:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1673 transitions. [2022-02-20 18:49:39,386 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:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1673 transitions. [2022-02-20 18:49:39,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1673 transitions. [2022-02-20 18:49:40,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1673 edges. 1673 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:40,640 INFO L225 Difference]: With dead ends: 1909 [2022-02-20 18:49:40,640 INFO L226 Difference]: Without dead ends: 1623 [2022-02-20 18:49:40,642 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:40,643 INFO L933 BasicCegarLoop]: 721 mSDtfsCounter, 2309 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:40,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2309 Valid, 2014 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:49:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-02-20 18:49:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1613. [2022-02-20 18:49:41,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:41,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1623 states. Second operand has 1613 states, 1612 states have (on average 1.5446650124069479) internal successors, (2490), 1612 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call 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:41,734 INFO L74 IsIncluded]: Start isIncluded. First operand 1623 states. Second operand has 1613 states, 1612 states have (on average 1.5446650124069479) internal successors, (2490), 1612 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call 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:41,738 INFO L87 Difference]: Start difference. First operand 1623 states. Second operand has 1613 states, 1612 states have (on average 1.5446650124069479) internal successors, (2490), 1612 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call 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:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:41,818 INFO L93 Difference]: Finished difference Result 1623 states and 2495 transitions. [2022-02-20 18:49:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2495 transitions. [2022-02-20 18:49:41,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:41,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:41,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 1613 states, 1612 states have (on average 1.5446650124069479) internal successors, (2490), 1612 states have internal predecessors, (2490), 0 states have call successors, (0), 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 1623 states. [2022-02-20 18:49:41,825 INFO L87 Difference]: Start difference. First operand has 1613 states, 1612 states have (on average 1.5446650124069479) internal successors, (2490), 1612 states have internal predecessors, (2490), 0 states have call successors, (0), 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 1623 states. [2022-02-20 18:49:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:41,900 INFO L93 Difference]: Finished difference Result 1623 states and 2495 transitions. [2022-02-20 18:49:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2495 transitions. [2022-02-20 18:49:41,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:41,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:41,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:41,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 1.5446650124069479) internal successors, (2490), 1612 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call 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:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2490 transitions. [2022-02-20 18:49:42,002 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2490 transitions. Word has length 97 [2022-02-20 18:49:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:42,003 INFO L470 AbstractCegarLoop]: Abstraction has 1613 states and 2490 transitions. [2022-02-20 18:49:42,004 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:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2490 transitions. [2022-02-20 18:49:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:49:42,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:42,007 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:42,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:49:42,008 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:42,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1453946111, now seen corresponding path program 1 times [2022-02-20 18:49:42,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:42,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202710625] [2022-02-20 18:49:42,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:42,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {12180#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(66, 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_104960~0 := 0;~__return_105100~0 := 0;~__tmp_105291_0~0 := 0;~__return_105325~0 := 0;~__return_105220~0 := 0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {12182#(<= (+ ~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__m1~2#1, main_~main____CPAchecker_TMP_0~1#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_~main____CPAchecker_TMP_0~0#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__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {12182#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:42,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {12182#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {12183#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:49:42,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {12183#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {12183#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:49:42,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {12183#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 >= 0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st5~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send5~0 == ~id5~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode5~0 % 256; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id6~0 >= 0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st6~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send6~0 == ~id6~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode6~0 % 256; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id5~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id6~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id5~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id6~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id5~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id6~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id5~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id6~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104960~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104960~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,153 INFO L290 TraceCheckUtils]: 43: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~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; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12184#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:42,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {12184#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {12181#false} is VALID [2022-02-20 18:49:42,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {12181#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256); {12181#false} is VALID [2022-02-20 18:49:42,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {12181#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {12181#false} assume !!(0 == ~mode4~0 % 256); {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {12181#false} assume !!(0 == ~alive4~0 % 256); {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {12181#false} assume !(~send4~0 != ~id4~0); {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {12181#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {12181#false} assume !!(0 == ~mode5~0 % 256); {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {12181#false} assume !!(0 == ~alive5~0 % 256); {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 63: Hoare triple {12181#false} assume !(~send5~0 != ~id5~0); {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 64: Hoare triple {12181#false} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,158 INFO L290 TraceCheckUtils]: 65: Hoare triple {12181#false} assume !!(0 == ~mode6~0 % 256); {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 66: Hoare triple {12181#false} assume !!(0 == ~alive6~0 % 256); {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 67: Hoare triple {12181#false} assume !(~send6~0 != ~id6~0); {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {12181#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; {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {12181#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 70: Hoare triple {12181#false} assume ~r1~0 < 6;main_~check__tmp~0#1 := 1;~__return_105100~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105100~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; {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 71: Hoare triple {12181#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 72: Hoare triple {12181#false} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,159 INFO L290 TraceCheckUtils]: 73: Hoare triple {12181#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {12181#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 75: Hoare triple {12181#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 76: Hoare triple {12181#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 77: Hoare triple {12181#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {12181#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 79: Hoare triple {12181#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {12181#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 81: Hoare triple {12181#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {12181#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,161 INFO L290 TraceCheckUtils]: 83: Hoare triple {12181#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {12181#false} is VALID [2022-02-20 18:49:42,161 INFO L290 TraceCheckUtils]: 84: Hoare triple {12181#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {12181#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {12181#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {12181#false} is VALID [2022-02-20 18:49:42,162 INFO L290 TraceCheckUtils]: 87: Hoare triple {12181#false} ~mode5~0 := 0;~__tmp_105291_0~0 := main_~main____CPAchecker_TMP_0~0#1; {12181#false} is VALID [2022-02-20 18:49:42,162 INFO L290 TraceCheckUtils]: 88: Hoare triple {12181#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_105291_0~0;havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,162 INFO L290 TraceCheckUtils]: 89: Hoare triple {12181#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12181#false} is VALID [2022-02-20 18:49:42,162 INFO L290 TraceCheckUtils]: 90: Hoare triple {12181#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {12181#false} is VALID [2022-02-20 18:49:42,162 INFO L290 TraceCheckUtils]: 91: Hoare triple {12181#false} ~mode6~0 := 0; {12181#false} is VALID [2022-02-20 18:49:42,162 INFO L290 TraceCheckUtils]: 92: Hoare triple {12181#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; {12181#false} is VALID [2022-02-20 18:49:42,163 INFO L290 TraceCheckUtils]: 93: Hoare triple {12181#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {12181#false} is VALID [2022-02-20 18:49:42,163 INFO L290 TraceCheckUtils]: 94: Hoare triple {12181#false} assume ~r1~0 < 6;main_~check__tmp~1#1 := 1; {12181#false} is VALID [2022-02-20 18:49:42,163 INFO L290 TraceCheckUtils]: 95: Hoare triple {12181#false} ~__return_105325~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105325~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; {12181#false} is VALID [2022-02-20 18:49:42,163 INFO L290 TraceCheckUtils]: 96: Hoare triple {12181#false} assume 0 == main_~assert__arg~1#1 % 256; {12181#false} is VALID [2022-02-20 18:49:42,163 INFO L290 TraceCheckUtils]: 97: Hoare triple {12181#false} assume !false; {12181#false} is VALID [2022-02-20 18:49:42,165 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:42,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:42,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202710625] [2022-02-20 18:49:42,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202710625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:42,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:42,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:42,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095858679] [2022-02-20 18:49:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:42,168 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:42,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:42,168 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:42,218 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:42,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:42,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:42,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:42,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:42,220 INFO L87 Difference]: Start difference. First operand 1613 states and 2490 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:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:46,810 INFO L93 Difference]: Finished difference Result 4341 states and 6773 transitions. [2022-02-20 18:49:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:46,811 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:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:46,812 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:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2022-02-20 18:49:46,815 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:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2022-02-20 18:49:46,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 831 transitions. [2022-02-20 18:49:47,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:47,600 INFO L225 Difference]: With dead ends: 4341 [2022-02-20 18:49:47,600 INFO L226 Difference]: Without dead ends: 2815 [2022-02-20 18:49:47,602 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:47,603 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 1363 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 344 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.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:47,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 344 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:49:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2022-02-20 18:49:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2813. [2022-02-20 18:49:50,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:50,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2815 states. Second operand has 2813 states, 2812 states have (on average 1.5526315789473684) internal successors, (4366), 2812 states have internal predecessors, (4366), 0 states have call successors, (0), 0 states have call 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:50,368 INFO L74 IsIncluded]: Start isIncluded. First operand 2815 states. Second operand has 2813 states, 2812 states have (on average 1.5526315789473684) internal successors, (4366), 2812 states have internal predecessors, (4366), 0 states have call successors, (0), 0 states have call 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:50,373 INFO L87 Difference]: Start difference. First operand 2815 states. Second operand has 2813 states, 2812 states have (on average 1.5526315789473684) internal successors, (4366), 2812 states have internal predecessors, (4366), 0 states have call successors, (0), 0 states have call 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:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:50,653 INFO L93 Difference]: Finished difference Result 2815 states and 4367 transitions. [2022-02-20 18:49:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4367 transitions. [2022-02-20 18:49:50,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:50,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:50,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 2813 states, 2812 states have (on average 1.5526315789473684) internal successors, (4366), 2812 states have internal predecessors, (4366), 0 states have call successors, (0), 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 2815 states. [2022-02-20 18:49:50,675 INFO L87 Difference]: Start difference. First operand has 2813 states, 2812 states have (on average 1.5526315789473684) internal successors, (4366), 2812 states have internal predecessors, (4366), 0 states have call successors, (0), 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 2815 states. [2022-02-20 18:49:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:50,887 INFO L93 Difference]: Finished difference Result 2815 states and 4367 transitions. [2022-02-20 18:49:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 4367 transitions. [2022-02-20 18:49:50,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:50,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:50,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:50,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2812 states have (on average 1.5526315789473684) internal successors, (4366), 2812 states have internal predecessors, (4366), 0 states have call successors, (0), 0 states have call 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:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4366 transitions. [2022-02-20 18:49:51,223 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4366 transitions. Word has length 98 [2022-02-20 18:49:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:51,224 INFO L470 AbstractCegarLoop]: Abstraction has 2813 states and 4366 transitions. [2022-02-20 18:49:51,224 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:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4366 transitions. [2022-02-20 18:49:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:49:51,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:51,226 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:51,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:49:51,226 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1726044558, now seen corresponding path program 1 times [2022-02-20 18:49:51,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:51,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63008398] [2022-02-20 18:49:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:51,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {27479#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(66, 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_104960~0 := 0;~__return_105100~0 := 0;~__tmp_105291_0~0 := 0;~__return_105325~0 := 0;~__return_105220~0 := 0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {27481#(<= (+ ~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__m1~2#1, main_~main____CPAchecker_TMP_0~1#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_~main____CPAchecker_TMP_0~0#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__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {27481#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:51,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {27481#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {27482#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:49:51,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {27482#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {27482#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:49:51,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {27482#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id6~0 >= 0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st6~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send6~0 == ~id6~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode6~0 % 256; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id6~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id6~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id6~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id6~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104960~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104960~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~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; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive1~0 % 256); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive2~0 % 256); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~id2~0); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive3~0 % 256); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~id3~0); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256); {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == ~alive4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {27483#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:51,305 INFO L290 TraceCheckUtils]: 58: Hoare triple {27483#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {27480#false} is VALID [2022-02-20 18:49:51,305 INFO L290 TraceCheckUtils]: 59: Hoare triple {27480#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256); {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {27480#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {27480#false} assume !!(0 == ~mode5~0 % 256); {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {27480#false} assume !!(0 == ~alive5~0 % 256); {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {27480#false} assume !(~send5~0 != ~id5~0); {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {27480#false} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {27480#false} assume !!(0 == ~mode6~0 % 256); {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {27480#false} assume !!(0 == ~alive6~0 % 256); {27480#false} is VALID [2022-02-20 18:49:51,306 INFO L290 TraceCheckUtils]: 67: Hoare triple {27480#false} assume !(~send6~0 != ~id6~0); {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {27480#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; {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {27480#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {27480#false} assume ~r1~0 < 6;main_~check__tmp~0#1 := 1;~__return_105100~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105100~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; {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 71: Hoare triple {27480#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 72: Hoare triple {27480#false} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 73: Hoare triple {27480#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 74: Hoare triple {27480#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 75: Hoare triple {27480#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,307 INFO L290 TraceCheckUtils]: 76: Hoare triple {27480#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 77: Hoare triple {27480#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 78: Hoare triple {27480#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 79: Hoare triple {27480#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 80: Hoare triple {27480#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 81: Hoare triple {27480#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 82: Hoare triple {27480#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 83: Hoare triple {27480#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {27480#false} is VALID [2022-02-20 18:49:51,308 INFO L290 TraceCheckUtils]: 84: Hoare triple {27480#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {27480#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 86: Hoare triple {27480#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 87: Hoare triple {27480#false} ~mode5~0 := 0;~__tmp_105291_0~0 := main_~main____CPAchecker_TMP_0~0#1; {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 88: Hoare triple {27480#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_105291_0~0;havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 89: Hoare triple {27480#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 90: Hoare triple {27480#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 91: Hoare triple {27480#false} ~mode6~0 := 0; {27480#false} is VALID [2022-02-20 18:49:51,309 INFO L290 TraceCheckUtils]: 92: Hoare triple {27480#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; {27480#false} is VALID [2022-02-20 18:49:51,310 INFO L290 TraceCheckUtils]: 93: Hoare triple {27480#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {27480#false} is VALID [2022-02-20 18:49:51,310 INFO L290 TraceCheckUtils]: 94: Hoare triple {27480#false} assume ~r1~0 < 6;main_~check__tmp~1#1 := 1; {27480#false} is VALID [2022-02-20 18:49:51,310 INFO L290 TraceCheckUtils]: 95: Hoare triple {27480#false} ~__return_105325~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105325~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; {27480#false} is VALID [2022-02-20 18:49:51,310 INFO L290 TraceCheckUtils]: 96: Hoare triple {27480#false} assume 0 == main_~assert__arg~1#1 % 256; {27480#false} is VALID [2022-02-20 18:49:51,310 INFO L290 TraceCheckUtils]: 97: Hoare triple {27480#false} assume !false; {27480#false} is VALID [2022-02-20 18:49:51,310 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:51,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:51,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63008398] [2022-02-20 18:49:51,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63008398] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:51,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:51,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:51,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043642149] [2022-02-20 18:49:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:51,312 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:51,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:51,312 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:51,374 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:51,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:51,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:51,375 INFO L87 Difference]: Start difference. First operand 2813 states and 4366 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:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:59,828 INFO L93 Difference]: Finished difference Result 7797 states and 12184 transitions. [2022-02-20 18:49:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:59,829 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:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:59,829 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:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 805 transitions. [2022-02-20 18:49:59,831 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:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 805 transitions. [2022-02-20 18:49:59,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 805 transitions. [2022-02-20 18:50:00,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 805 edges. 805 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:01,337 INFO L225 Difference]: With dead ends: 7797 [2022-02-20 18:50:01,338 INFO L226 Difference]: Without dead ends: 5101 [2022-02-20 18:50:01,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:01,341 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 1325 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:01,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1325 Valid, 346 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2022-02-20 18:50:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5099. [2022-02-20 18:50:06,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:06,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5101 states. Second operand has 5099 states, 5098 states have (on average 1.5545311887014515) internal successors, (7925), 5098 states have internal predecessors, (7925), 0 states have call successors, (0), 0 states have call 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,710 INFO L74 IsIncluded]: Start isIncluded. First operand 5101 states. Second operand has 5099 states, 5098 states have (on average 1.5545311887014515) internal successors, (7925), 5098 states have internal predecessors, (7925), 0 states have call successors, (0), 0 states have call 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,714 INFO L87 Difference]: Start difference. First operand 5101 states. Second operand has 5099 states, 5098 states have (on average 1.5545311887014515) internal successors, (7925), 5098 states have internal predecessors, (7925), 0 states have call successors, (0), 0 states have call 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:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:07,426 INFO L93 Difference]: Finished difference Result 5101 states and 7926 transitions. [2022-02-20 18:50:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5101 states and 7926 transitions. [2022-02-20 18:50:07,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:07,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:07,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 5099 states, 5098 states have (on average 1.5545311887014515) internal successors, (7925), 5098 states have internal predecessors, (7925), 0 states have call successors, (0), 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 5101 states. [2022-02-20 18:50:07,443 INFO L87 Difference]: Start difference. First operand has 5099 states, 5098 states have (on average 1.5545311887014515) internal successors, (7925), 5098 states have internal predecessors, (7925), 0 states have call successors, (0), 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 5101 states. [2022-02-20 18:50:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:08,155 INFO L93 Difference]: Finished difference Result 5101 states and 7926 transitions. [2022-02-20 18:50:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5101 states and 7926 transitions. [2022-02-20 18:50:08,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:08,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:08,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:08,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5098 states have (on average 1.5545311887014515) internal successors, (7925), 5098 states have internal predecessors, (7925), 0 states have call successors, (0), 0 states have call 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:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 7925 transitions. [2022-02-20 18:50:09,175 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 7925 transitions. Word has length 98 [2022-02-20 18:50:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:09,175 INFO L470 AbstractCegarLoop]: Abstraction has 5099 states and 7925 transitions. [2022-02-20 18:50:09,175 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:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 7925 transitions. [2022-02-20 18:50:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:50:09,178 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:09,178 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:09,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:09,178 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:09,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1050081644, now seen corresponding path program 1 times [2022-02-20 18:50:09,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:09,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54088741] [2022-02-20 18:50:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:09,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {55306#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(66, 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_104960~0 := 0;~__return_105100~0 := 0;~__tmp_105291_0~0 := 0;~__return_105325~0 := 0;~__return_105220~0 := 0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {55308#(<= (+ ~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__m1~2#1, main_~main____CPAchecker_TMP_0~1#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_~main____CPAchecker_TMP_0~0#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__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st5~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~send5~0 == ~id5~0; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode5~0 % 256; {55308#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:09,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {55308#(<= (+ ~nomsg~0 1) 0)} assume ~id6~0 >= 0; {55309#(<= (+ ~nomsg~0 1) ~id6~0)} is VALID [2022-02-20 18:50:09,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {55309#(<= (+ ~nomsg~0 1) ~id6~0)} assume 0 == ~st6~0; {55309#(<= (+ ~nomsg~0 1) ~id6~0)} is VALID [2022-02-20 18:50:09,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {55309#(<= (+ ~nomsg~0 1) ~id6~0)} assume ~send6~0 == ~id6~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume 0 == ~mode6~0 % 256; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id2~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id3~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id4~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id5~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id1~0 != ~id6~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id3~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id4~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id5~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id2~0 != ~id6~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id4~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id5~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id3~0 != ~id6~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id4~0 != ~id5~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id4~0 != ~id6~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_104960~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_104960~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {55310#(<= (+ ~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; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode1~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive1~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode2~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive2~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send2~0 != ~id2~0); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode3~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive3~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send3~0 != ~id3~0); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode4~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive4~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send4~0 != ~id4~0); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode5~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~alive5~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send5~0 != ~id5~0); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} ~mode5~0 := 1;havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !!(0 == ~mode6~0 % 256); {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,251 INFO L290 TraceCheckUtils]: 65: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(0 == ~alive6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {55310#(<= (+ ~nomsg~0 1) ~send6~0)} is VALID [2022-02-20 18:50:09,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {55310#(<= (+ ~nomsg~0 1) ~send6~0)} assume !(~send6~0 != ~nomsg~0);main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {55307#false} is VALID [2022-02-20 18:50:09,252 INFO L290 TraceCheckUtils]: 67: Hoare triple {55307#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); {55307#false} is VALID [2022-02-20 18:50:09,252 INFO L290 TraceCheckUtils]: 68: Hoare triple {55307#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; {55307#false} is VALID [2022-02-20 18:50:09,252 INFO L290 TraceCheckUtils]: 69: Hoare triple {55307#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {55307#false} is VALID [2022-02-20 18:50:09,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {55307#false} assume ~r1~0 < 6;main_~check__tmp~0#1 := 1;~__return_105100~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_105100~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; {55307#false} is VALID [2022-02-20 18:50:09,252 INFO L290 TraceCheckUtils]: 71: Hoare triple {55307#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {55307#false} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {55307#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {55307#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {55307#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {55307#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {55307#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 78: Hoare triple {55307#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 79: Hoare triple {55307#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,253 INFO L290 TraceCheckUtils]: 80: Hoare triple {55307#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 81: Hoare triple {55307#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 82: Hoare triple {55307#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 83: Hoare triple {55307#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {55307#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 85: Hoare triple {55307#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {55307#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 87: Hoare triple {55307#false} ~mode5~0 := 0;~__tmp_105291_0~0 := main_~main____CPAchecker_TMP_0~0#1; {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 88: Hoare triple {55307#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_105291_0~0;havoc main_~node6__m6~1#1;main_~node6__m6~1#1 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {55307#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 90: Hoare triple {55307#false} assume !(main_~node6__m6~1#1 != ~nomsg~0); {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 91: Hoare triple {55307#false} ~mode6~0 := 0; {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 92: Hoare triple {55307#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; {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {55307#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {55307#false} assume ~r1~0 < 6;main_~check__tmp~1#1 := 1; {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 95: Hoare triple {55307#false} ~__return_105325~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_105325~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; {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 96: Hoare triple {55307#false} assume 0 == main_~assert__arg~1#1 % 256; {55307#false} is VALID [2022-02-20 18:50:09,255 INFO L290 TraceCheckUtils]: 97: Hoare triple {55307#false} assume !false; {55307#false} is VALID [2022-02-20 18:50:09,256 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:09,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:09,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54088741] [2022-02-20 18:50:09,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54088741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:09,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:09,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:09,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150338265] [2022-02-20 18:50:09,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:09,257 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:09,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:09,257 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:09,312 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:09,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:09,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:09,313 INFO L87 Difference]: Start difference. First operand 5099 states and 7925 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:50:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:30,563 INFO L93 Difference]: Finished difference Result 14365 states and 22445 transitions. [2022-02-20 18:50:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:30,563 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:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:30,563 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:50:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2022-02-20 18:50:30,566 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:50:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2022-02-20 18:50:30,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 764 transitions. [2022-02-20 18:50:31,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:34,443 INFO L225 Difference]: With dead ends: 14365 [2022-02-20 18:50:34,443 INFO L226 Difference]: Without dead ends: 9461 [2022-02-20 18:50:34,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:34,449 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 1277 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:34,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1277 Valid, 359 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states.