./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52f505c2033e0aec4a19441e3af9fb9949b71da33ecc0d15d8cd0b9d7a123c92 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:53:13,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:53:13,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:53:13,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:53:13,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:53:13,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:53:13,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:53:13,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:53:13,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:53:13,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:53:13,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:53:13,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:53:13,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:53:13,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:53:13,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:53:13,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:53:13,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:53:13,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:53:13,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:53:13,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:53:13,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:53:13,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:53:13,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:53:13,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:53:13,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:53:13,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:53:13,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:53:13,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:53:13,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:53:13,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:53:13,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:53:13,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:53:13,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:53:13,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:53:13,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:53:13,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:53:13,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:53:13,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:53:13,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:53:13,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:53:13,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:53:13,774 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:53:13,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:53:13,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:53:13,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:53:13,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:53:13,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:53:13,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:53:13,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:53:13,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:53:13,790 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:53:13,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:53:13,790 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:53:13,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:53:13,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:53:13,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:53:13,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:53:13,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:53:13,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:53:13,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:53:13,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:53:13,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:53:13,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:53:13,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:53:13,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:53:13,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:53:13,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:13,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:53:13,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:53:13,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:53:13,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:53:13,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:53:13,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:53:13,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:53:13,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:53:13,794 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 -> 52f505c2033e0aec4a19441e3af9fb9949b71da33ecc0d15d8cd0b9d7a123c92 [2022-02-20 18:53:13,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:53:13,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:53:13,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:53:13,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:53:13,966 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:53:13,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:53:14,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ab324fe/3aa784a7b3c6482199edfb821a9efb7e/FLAGa0de6a4d2 [2022-02-20 18:53:14,374 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:53:14,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:53:14,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ab324fe/3aa784a7b3c6482199edfb821a9efb7e/FLAGa0de6a4d2 [2022-02-20 18:53:14,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ab324fe/3aa784a7b3c6482199edfb821a9efb7e [2022-02-20 18:53:14,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:53:14,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:53:14,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:14,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:53:14,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:53:14,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:14" (1/1) ... [2022-02-20 18:53:14,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636eb229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:14, skipping insertion in model container [2022-02-20 18:53:14,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:14" (1/1) ... [2022-02-20 18:53:14,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:53:14,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:53:15,032 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.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7836,7849] [2022-02-20 18:53:15,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:15,073 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:53:15,142 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.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[7836,7849] [2022-02-20 18:53:15,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:15,191 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:53:15,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15 WrapperNode [2022-02-20 18:53:15,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:15,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:15,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:53:15,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:53:15,204 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:53:15" (1/1) ... [2022-02-20 18:53:15,227 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:53:15" (1/1) ... [2022-02-20 18:53:15,279 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 618 [2022-02-20 18:53:15,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:15,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:53:15,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:53:15,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:53:15,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:53:15,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:53:15,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:53:15,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:53:15,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (1/1) ... [2022-02-20 18:53:15,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:15,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:53:15,349 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:53:15,354 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:53:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:53:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:53:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:53:15,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:53:15,501 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:53:15,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:53:16,083 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:53:16,089 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:53:16,089 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:53:16,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:16 BoogieIcfgContainer [2022-02-20 18:53:16,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:53:16,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:53:16,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:53:16,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:53:16,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:53:14" (1/3) ... [2022-02-20 18:53:16,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0ccab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:16, skipping insertion in model container [2022-02-20 18:53:16,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:15" (2/3) ... [2022-02-20 18:53:16,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0ccab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:16, skipping insertion in model container [2022-02-20 18:53:16,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:16" (3/3) ... [2022-02-20 18:53:16,100 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:53:16,103 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:53:16,103 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:53:16,131 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:53:16,135 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:53:16,135 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:53:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 148 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:53:16,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:16,155 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] [2022-02-20 18:53:16,155 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1577999170, now seen corresponding path program 1 times [2022-02-20 18:53:16,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:16,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493005206] [2022-02-20 18:53:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:16,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {152#true} is VALID [2022-02-20 18:53:16,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {152#true} is VALID [2022-02-20 18:53:16,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume 0 == ~r1~0 % 256; {152#true} is VALID [2022-02-20 18:53:16,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} assume ~id1~0 >= 0; {152#true} is VALID [2022-02-20 18:53:16,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume 0 == ~st1~0; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:16,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:16,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:16,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(<= ~st1~0 0)} assume ~id2~0 >= 0; {154#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:16,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(<= ~st1~0 0)} assume 0 == ~st2~0; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {155#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {156#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {157#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,610 INFO L290 TraceCheckUtils]: 53: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,615 INFO L290 TraceCheckUtils]: 62: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,618 INFO L290 TraceCheckUtils]: 69: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;havoc main_~check__tmp~1#1; {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:16,619 INFO L290 TraceCheckUtils]: 71: Hoare triple {158#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {153#false} is VALID [2022-02-20 18:53:16,619 INFO L290 TraceCheckUtils]: 72: Hoare triple {153#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {153#false} is VALID [2022-02-20 18:53:16,619 INFO L290 TraceCheckUtils]: 73: Hoare triple {153#false} assume 0 == main_~assert__arg~1#1 % 256; {153#false} is VALID [2022-02-20 18:53:16,620 INFO L290 TraceCheckUtils]: 74: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:53:16,621 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:53:16,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:16,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493005206] [2022-02-20 18:53:16,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493005206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:16,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:16,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:16,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148366996] [2022-02-20 18:53:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:53:16,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:16,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:16,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:16,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:16,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:16,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:16,724 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7551020408163265) internal successors, (258), 148 states have internal predecessors, (258), 0 states have call successors, (0), 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 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:18,661 INFO L93 Difference]: Finished difference Result 832 states and 1345 transitions. [2022-02-20 18:53:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:53:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:53:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1345 transitions. [2022-02-20 18:53:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1345 transitions. [2022-02-20 18:53:18,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1345 transitions. [2022-02-20 18:53:19,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1345 edges. 1345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:19,624 INFO L225 Difference]: With dead ends: 832 [2022-02-20 18:53:19,625 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 18:53:19,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:53:19,629 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 1621 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:19,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1621 Valid, 1874 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 18:53:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 226. [2022-02-20 18:53:19,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:19,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,730 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,730 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:19,774 INFO L93 Difference]: Finished difference Result 750 states and 1150 transitions. [2022-02-20 18:53:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1150 transitions. [2022-02-20 18:53:19,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:19,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:19,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:53:19,778 INFO L87 Difference]: Start difference. First operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 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 750 states. [2022-02-20 18:53:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:19,803 INFO L93 Difference]: Finished difference Result 750 states and 1150 transitions. [2022-02-20 18:53:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1150 transitions. [2022-02-20 18:53:19,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:19,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:19,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:19,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.4622222222222223) internal successors, (329), 225 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 329 transitions. [2022-02-20 18:53:19,811 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 329 transitions. Word has length 75 [2022-02-20 18:53:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:19,811 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 329 transitions. [2022-02-20 18:53:19,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 329 transitions. [2022-02-20 18:53:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:19,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:19,813 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] [2022-02-20 18:53:19,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:53:19,814 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:19,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1882204162, now seen corresponding path program 1 times [2022-02-20 18:53:19,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:19,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51862460] [2022-02-20 18:53:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:19,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {3080#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {3080#true} is VALID [2022-02-20 18:53:19,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {3080#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {3080#true} is VALID [2022-02-20 18:53:19,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {3080#true} assume 0 == ~r1~0 % 256; {3080#true} is VALID [2022-02-20 18:53:19,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {3080#true} assume ~id1~0 >= 0; {3080#true} is VALID [2022-02-20 18:53:19,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {3080#true} assume 0 == ~st1~0; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:19,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:19,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:19,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#(<= ~st1~0 0)} assume ~id2~0 >= 0; {3082#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:19,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {3082#(<= ~st1~0 0)} assume 0 == ~st2~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {3083#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {3084#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:19,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {3085#(<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,960 INFO L290 TraceCheckUtils]: 67: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,960 INFO L290 TraceCheckUtils]: 68: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,962 INFO L290 TraceCheckUtils]: 71: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,962 INFO L290 TraceCheckUtils]: 72: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~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;havoc main_~check__tmp~1#1; {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:19,963 INFO L290 TraceCheckUtils]: 73: Hoare triple {3086#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st5~0 ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {3081#false} is VALID [2022-02-20 18:53:19,963 INFO L290 TraceCheckUtils]: 74: Hoare triple {3081#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {3081#false} is VALID [2022-02-20 18:53:19,963 INFO L290 TraceCheckUtils]: 75: Hoare triple {3081#false} assume 0 == main_~assert__arg~1#1 % 256; {3081#false} is VALID [2022-02-20 18:53:19,963 INFO L290 TraceCheckUtils]: 76: Hoare triple {3081#false} assume !false; {3081#false} is VALID [2022-02-20 18:53:19,964 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:53:19,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:19,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51862460] [2022-02-20 18:53:19,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51862460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:19,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:19,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:19,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379956113] [2022-02-20 18:53:19,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:19,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:19,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:20,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:20,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:20,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:20,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:20,018 INFO L87 Difference]: Start difference. First operand 226 states and 329 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:21,362 INFO L93 Difference]: Finished difference Result 921 states and 1431 transitions. [2022-02-20 18:53:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:21,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:21,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 867 transitions. [2022-02-20 18:53:21,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 867 edges. 867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:21,969 INFO L225 Difference]: With dead ends: 921 [2022-02-20 18:53:21,969 INFO L226 Difference]: Without dead ends: 801 [2022-02-20 18:53:21,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:21,977 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 1030 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:21,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1030 Valid, 1153 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-02-20 18:53:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 355. [2022-02-20 18:53:22,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:22,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 801 states. Second operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:22,200 INFO L74 IsIncluded]: Start isIncluded. First operand 801 states. Second operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:22,201 INFO L87 Difference]: Start difference. First operand 801 states. Second operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:22,225 INFO L93 Difference]: Finished difference Result 801 states and 1239 transitions. [2022-02-20 18:53:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1239 transitions. [2022-02-20 18:53:22,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:22,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:22,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 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 801 states. [2022-02-20 18:53:22,227 INFO L87 Difference]: Start difference. First operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 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 801 states. [2022-02-20 18:53:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:22,252 INFO L93 Difference]: Finished difference Result 801 states and 1239 transitions. [2022-02-20 18:53:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1239 transitions. [2022-02-20 18:53:22,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:22,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:22,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:22,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.5112994350282485) internal successors, (535), 354 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 535 transitions. [2022-02-20 18:53:22,261 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 535 transitions. Word has length 77 [2022-02-20 18:53:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:22,262 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 535 transitions. [2022-02-20 18:53:22,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 535 transitions. [2022-02-20 18:53:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:22,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:22,263 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] [2022-02-20 18:53:22,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:53:22,263 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -120044916, now seen corresponding path program 1 times [2022-02-20 18:53:22,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:22,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827723728] [2022-02-20 18:53:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:22,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:22,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {6410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {6410#true} is VALID [2022-02-20 18:53:22,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {6410#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {6410#true} is VALID [2022-02-20 18:53:22,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {6410#true} assume 0 == ~r1~0 % 256; {6410#true} is VALID [2022-02-20 18:53:22,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {6410#true} assume ~id1~0 >= 0; {6410#true} is VALID [2022-02-20 18:53:22,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {6410#true} assume 0 == ~st1~0; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {6412#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {6412#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {6412#(<= ~st1~0 0)} assume ~id2~0 >= 0; {6412#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:22,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(<= ~st1~0 0)} assume 0 == ~st2~0; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {6413#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {6413#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {6414#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,411 INFO L290 TraceCheckUtils]: 64: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,412 INFO L290 TraceCheckUtils]: 66: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:22,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {6415#(<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,414 INFO L290 TraceCheckUtils]: 71: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode5~0 := 0; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,414 INFO L290 TraceCheckUtils]: 72: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~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;havoc main_~check__tmp~1#1; {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:53:22,415 INFO L290 TraceCheckUtils]: 73: Hoare triple {6416#(and (<= (+ ~st5~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {6411#false} is VALID [2022-02-20 18:53:22,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {6411#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {6411#false} is VALID [2022-02-20 18:53:22,415 INFO L290 TraceCheckUtils]: 75: Hoare triple {6411#false} assume 0 == main_~assert__arg~1#1 % 256; {6411#false} is VALID [2022-02-20 18:53:22,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {6411#false} assume !false; {6411#false} is VALID [2022-02-20 18:53:22,415 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:53:22,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:22,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827723728] [2022-02-20 18:53:22,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827723728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:22,416 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:22,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:22,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330516093] [2022-02-20 18:53:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:22,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:22,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:22,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:22,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:22,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:22,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:22,469 INFO L87 Difference]: Start difference. First operand 355 states and 535 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:23,961 INFO L93 Difference]: Finished difference Result 1045 states and 1629 transitions. [2022-02-20 18:53:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:23,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-02-20 18:53:23,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 867 transitions. [2022-02-20 18:53:24,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 867 edges. 867 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:24,569 INFO L225 Difference]: With dead ends: 1045 [2022-02-20 18:53:24,569 INFO L226 Difference]: Without dead ends: 925 [2022-02-20 18:53:24,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:24,571 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 1293 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:24,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1293 Valid, 1070 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-02-20 18:53:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 538. [2022-02-20 18:53:24,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:24,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 925 states. Second operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,942 INFO L74 IsIncluded]: Start isIncluded. First operand 925 states. Second operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,943 INFO L87 Difference]: Start difference. First operand 925 states. Second operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:24,973 INFO L93 Difference]: Finished difference Result 925 states and 1437 transitions. [2022-02-20 18:53:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1437 transitions. [2022-02-20 18:53:24,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:24,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:24,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 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 925 states. [2022-02-20 18:53:24,977 INFO L87 Difference]: Start difference. First operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 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 925 states. [2022-02-20 18:53:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:25,007 INFO L93 Difference]: Finished difference Result 925 states and 1437 transitions. [2022-02-20 18:53:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1437 transitions. [2022-02-20 18:53:25,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:25,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:25,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:25,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.5400372439478585) internal successors, (827), 537 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 827 transitions. [2022-02-20 18:53:25,026 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 827 transitions. Word has length 77 [2022-02-20 18:53:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:25,027 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 827 transitions. [2022-02-20 18:53:25,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 827 transitions. [2022-02-20 18:53:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:25,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:25,028 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] [2022-02-20 18:53:25,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:53:25,029 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:25,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1696566079, now seen corresponding path program 1 times [2022-02-20 18:53:25,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:25,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957733193] [2022-02-20 18:53:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:25,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {10414#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {10414#true} is VALID [2022-02-20 18:53:25,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {10414#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {10414#true} is VALID [2022-02-20 18:53:25,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {10414#true} assume 0 == ~r1~0 % 256; {10414#true} is VALID [2022-02-20 18:53:25,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {10414#true} assume ~id1~0 >= 0; {10414#true} is VALID [2022-02-20 18:53:25,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {10414#true} assume 0 == ~st1~0; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:25,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:25,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:25,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:53:25,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {10416#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:25,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:25,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:25,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:53:25,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {10417#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {10418#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:53:25,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {10419#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode1~0 % 256); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,318 INFO L290 TraceCheckUtils]: 60: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,318 INFO L290 TraceCheckUtils]: 61: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,320 INFO L290 TraceCheckUtils]: 66: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,320 INFO L290 TraceCheckUtils]: 67: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,321 INFO L290 TraceCheckUtils]: 69: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~mode5~0 := 0; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;havoc main_~check__tmp~1#1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,322 INFO L290 TraceCheckUtils]: 71: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,323 INFO L290 TraceCheckUtils]: 72: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:53:25,323 INFO L290 TraceCheckUtils]: 73: Hoare triple {10420#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);main_~check__tmp~1#1 := 0; {10415#false} is VALID [2022-02-20 18:53:25,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {10415#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {10415#false} is VALID [2022-02-20 18:53:25,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {10415#false} assume 0 == main_~assert__arg~1#1 % 256; {10415#false} is VALID [2022-02-20 18:53:25,323 INFO L290 TraceCheckUtils]: 76: Hoare triple {10415#false} assume !false; {10415#false} is VALID [2022-02-20 18:53:25,324 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:53:25,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:25,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957733193] [2022-02-20 18:53:25,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957733193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:25,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:25,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:25,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203013642] [2022-02-20 18:53:25,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:25,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:25,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:25,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:25,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:25,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:25,405 INFO L87 Difference]: Start difference. First operand 538 states and 827 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:26,808 INFO L93 Difference]: Finished difference Result 955 states and 1491 transitions. [2022-02-20 18:53:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:26,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 427 transitions. [2022-02-20 18:53:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 427 transitions. [2022-02-20 18:53:26,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 427 transitions. [2022-02-20 18:53:27,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:27,091 INFO L225 Difference]: With dead ends: 955 [2022-02-20 18:53:27,091 INFO L226 Difference]: Without dead ends: 540 [2022-02-20 18:53:27,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:53:27,102 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 700 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:27,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 682 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-02-20 18:53:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2022-02-20 18:53:27,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:27,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:27,494 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:27,495 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:27,506 INFO L93 Difference]: Finished difference Result 540 states and 824 transitions. [2022-02-20 18:53:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 824 transitions. [2022-02-20 18:53:27,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:27,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:27,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 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 540 states. [2022-02-20 18:53:27,508 INFO L87 Difference]: Start difference. First operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 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 540 states. [2022-02-20 18:53:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:27,519 INFO L93 Difference]: Finished difference Result 540 states and 824 transitions. [2022-02-20 18:53:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 824 transitions. [2022-02-20 18:53:27,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:27,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:27,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:27,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.5325884543761639) internal successors, (823), 537 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 823 transitions. [2022-02-20 18:53:27,549 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 823 transitions. Word has length 77 [2022-02-20 18:53:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:27,549 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 823 transitions. [2022-02-20 18:53:27,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 823 transitions. [2022-02-20 18:53:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:27,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:27,550 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] [2022-02-20 18:53:27,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:53:27,551 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:27,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1904417886, now seen corresponding path program 1 times [2022-02-20 18:53:27,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:27,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190130180] [2022-02-20 18:53:27,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:27,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:27,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {13525#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {13525#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {13525#true} assume 0 == ~r1~0 % 256; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {13525#true} assume ~id1~0 >= 0; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {13525#true} assume 0 == ~st1~0; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {13525#true} assume ~send1~0 == ~id1~0; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {13525#true} assume 0 == ~mode1~0 % 256; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {13525#true} assume ~id2~0 >= 0; {13525#true} is VALID [2022-02-20 18:53:27,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {13525#true} assume 0 == ~st2~0; {13525#true} is VALID [2022-02-20 18:53:27,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {13525#true} assume ~send2~0 == ~id2~0; {13525#true} is VALID [2022-02-20 18:53:27,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {13525#true} assume 0 == ~mode2~0 % 256; {13525#true} is VALID [2022-02-20 18:53:27,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {13525#true} assume ~id3~0 >= 0; {13525#true} is VALID [2022-02-20 18:53:27,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {13525#true} assume 0 == ~st3~0; {13525#true} is VALID [2022-02-20 18:53:27,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {13525#true} assume ~send3~0 == ~id3~0; {13525#true} is VALID [2022-02-20 18:53:27,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {13525#true} assume 0 == ~mode3~0 % 256; {13525#true} is VALID [2022-02-20 18:53:27,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {13525#true} assume ~id4~0 >= 0; {13525#true} is VALID [2022-02-20 18:53:27,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {13525#true} assume 0 == ~st4~0; {13525#true} is VALID [2022-02-20 18:53:27,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {13525#true} assume ~send4~0 == ~id4~0; {13525#true} is VALID [2022-02-20 18:53:27,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {13525#true} assume 0 == ~mode4~0 % 256; {13525#true} is VALID [2022-02-20 18:53:27,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {13525#true} assume ~id5~0 >= 0; {13525#true} is VALID [2022-02-20 18:53:27,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {13525#true} assume 0 == ~st5~0; {13525#true} is VALID [2022-02-20 18:53:27,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {13525#true} assume ~send5~0 == ~id5~0; {13525#true} is VALID [2022-02-20 18:53:27,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {13525#true} assume 0 == ~mode5~0 % 256; {13525#true} is VALID [2022-02-20 18:53:27,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {13525#true} assume ~id1~0 != ~id2~0; {13525#true} is VALID [2022-02-20 18:53:27,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {13525#true} assume ~id1~0 != ~id3~0; {13525#true} is VALID [2022-02-20 18:53:27,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {13525#true} assume ~id1~0 != ~id4~0; {13525#true} is VALID [2022-02-20 18:53:27,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {13525#true} assume ~id1~0 != ~id5~0; {13525#true} is VALID [2022-02-20 18:53:27,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {13525#true} assume ~id2~0 != ~id3~0; {13525#true} is VALID [2022-02-20 18:53:27,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {13525#true} assume ~id2~0 != ~id4~0; {13525#true} is VALID [2022-02-20 18:53:27,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {13525#true} assume ~id2~0 != ~id5~0; {13525#true} is VALID [2022-02-20 18:53:27,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {13525#true} assume ~id3~0 != ~id4~0; {13525#true} is VALID [2022-02-20 18:53:27,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {13525#true} assume ~id3~0 != ~id5~0; {13525#true} is VALID [2022-02-20 18:53:27,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {13525#true} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {13525#true} is VALID [2022-02-20 18:53:27,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {13525#true} 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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {13525#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:53:27,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {13525#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {13525#true} is VALID [2022-02-20 18:53:27,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {13525#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {13525#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:53:27,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {13525#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13525#true} is VALID [2022-02-20 18:53:27,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {13525#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {13525#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:53:27,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {13525#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {13525#true} is VALID [2022-02-20 18:53:27,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {13525#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {13525#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:53:27,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {13525#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {13525#true} is VALID [2022-02-20 18:53:27,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {13525#true} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {13525#true} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {13525#true} is VALID [2022-02-20 18:53:27,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {13525#true} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {13525#true} is VALID [2022-02-20 18:53:27,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {13525#true} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {13525#true} is VALID [2022-02-20 18:53:27,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {13525#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13525#true} is VALID [2022-02-20 18:53:27,632 INFO L290 TraceCheckUtils]: 50: Hoare triple {13525#true} assume !(~r1~0 % 256 >= 5); {13525#true} is VALID [2022-02-20 18:53:27,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {13525#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {13525#true} is VALID [2022-02-20 18:53:27,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {13525#true} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {13525#true} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {13525#true} assume !(0 == ~mode1~0 % 256); {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {13525#true} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {13525#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {13525#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {13525#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {13525#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:53:27,633 INFO L290 TraceCheckUtils]: 60: Hoare triple {13525#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {13525#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {13525#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:53:27,634 INFO L290 TraceCheckUtils]: 63: Hoare triple {13525#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {13525#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,634 INFO L290 TraceCheckUtils]: 65: Hoare triple {13525#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:53:27,634 INFO L290 TraceCheckUtils]: 66: Hoare triple {13525#true} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,634 INFO L290 TraceCheckUtils]: 67: Hoare triple {13525#true} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {13525#true} is VALID [2022-02-20 18:53:27,636 INFO L290 TraceCheckUtils]: 68: Hoare triple {13525#true} assume !(main_~node5__m5~1#1 != ~nomsg~0); {13525#true} is VALID [2022-02-20 18:53:27,636 INFO L290 TraceCheckUtils]: 69: Hoare triple {13525#true} ~mode5~0 := 0; {13525#true} is VALID [2022-02-20 18:53:27,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {13525#true} ~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;havoc main_~check__tmp~1#1; {13525#true} is VALID [2022-02-20 18:53:27,641 INFO L290 TraceCheckUtils]: 71: Hoare triple {13525#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {13525#true} is VALID [2022-02-20 18:53:27,642 INFO L290 TraceCheckUtils]: 72: Hoare triple {13525#true} assume ~r1~0 % 256 >= 5; {13527#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 4)))} is VALID [2022-02-20 18:53:27,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {13527#(not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 4)))} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {13526#false} is VALID [2022-02-20 18:53:27,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {13526#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {13526#false} is VALID [2022-02-20 18:53:27,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {13526#false} assume 0 == main_~assert__arg~1#1 % 256; {13526#false} is VALID [2022-02-20 18:53:27,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {13526#false} assume !false; {13526#false} is VALID [2022-02-20 18:53:27,644 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:53:27,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:27,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190130180] [2022-02-20 18:53:27,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190130180] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:27,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:27,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:27,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392417801] [2022-02-20 18:53:27,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:27,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:27,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:27,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:27,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:27,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:27,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:27,682 INFO L87 Difference]: Start difference. First operand 538 states and 823 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:28,867 INFO L93 Difference]: Finished difference Result 1323 states and 2066 transitions. [2022-02-20 18:53:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:28,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-02-20 18:53:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-02-20 18:53:28,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 385 transitions. [2022-02-20 18:53:29,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:29,122 INFO L225 Difference]: With dead ends: 1323 [2022-02-20 18:53:29,122 INFO L226 Difference]: Without dead ends: 908 [2022-02-20 18:53:29,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:29,123 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 83 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:29,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 467 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-02-20 18:53:29,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 892. [2022-02-20 18:53:29,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:29,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 908 states. Second operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:29,901 INFO L74 IsIncluded]: Start isIncluded. First operand 908 states. Second operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:29,902 INFO L87 Difference]: Start difference. First operand 908 states. Second operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:29,929 INFO L93 Difference]: Finished difference Result 908 states and 1393 transitions. [2022-02-20 18:53:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1393 transitions. [2022-02-20 18:53:29,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:29,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:29,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 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 908 states. [2022-02-20 18:53:29,933 INFO L87 Difference]: Start difference. First operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 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 908 states. [2022-02-20 18:53:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:29,959 INFO L93 Difference]: Finished difference Result 908 states and 1393 transitions. [2022-02-20 18:53:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1393 transitions. [2022-02-20 18:53:29,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:29,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:29,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:29,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.5387205387205387) internal successors, (1371), 891 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1371 transitions. [2022-02-20 18:53:29,996 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1371 transitions. Word has length 77 [2022-02-20 18:53:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:29,996 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1371 transitions. [2022-02-20 18:53:29,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1371 transitions. [2022-02-20 18:53:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:29,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:29,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:29,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:53:29,998 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1745860562, now seen corresponding path program 1 times [2022-02-20 18:53:29,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:29,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269508207] [2022-02-20 18:53:29,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:30,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {18379#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {18379#true} is VALID [2022-02-20 18:53:30,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {18379#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {18379#true} is VALID [2022-02-20 18:53:30,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {18379#true} assume 0 == ~r1~0 % 256; {18379#true} is VALID [2022-02-20 18:53:30,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {18379#true} assume ~id1~0 >= 0; {18379#true} is VALID [2022-02-20 18:53:30,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {18379#true} assume 0 == ~st1~0; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:30,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {18381#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:30,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {18381#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:30,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {18381#(<= ~st1~0 0)} assume ~id2~0 >= 0; {18381#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:30,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {18381#(<= ~st1~0 0)} assume 0 == ~st2~0; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {18382#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {18382#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {18383#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,109 INFO L290 TraceCheckUtils]: 51: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,111 INFO L290 TraceCheckUtils]: 58: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,114 INFO L290 TraceCheckUtils]: 66: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,114 INFO L290 TraceCheckUtils]: 67: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,115 INFO L290 TraceCheckUtils]: 68: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 != ~nomsg~0; {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 > ~id5~0); {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:30,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {18384#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node5__m5~1#1 == ~id5~0;~st5~0 := 1; {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:30,116 INFO L290 TraceCheckUtils]: 71: Hoare triple {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} ~mode5~0 := 0; {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:30,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~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;havoc main_~check__tmp~1#1; {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} is VALID [2022-02-20 18:53:30,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {18385#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st5~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {18380#false} is VALID [2022-02-20 18:53:30,117 INFO L290 TraceCheckUtils]: 74: Hoare triple {18380#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {18380#false} is VALID [2022-02-20 18:53:30,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {18380#false} assume 0 == main_~assert__arg~1#1 % 256; {18380#false} is VALID [2022-02-20 18:53:30,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {18380#false} assume !false; {18380#false} is VALID [2022-02-20 18:53:30,117 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:53:30,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:30,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269508207] [2022-02-20 18:53:30,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269508207] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:30,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:30,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:30,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390650302] [2022-02-20 18:53:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:30,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:30,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:30,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:30,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:30,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:30,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:30,163 INFO L87 Difference]: Start difference. First operand 892 states and 1371 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:32,502 INFO L93 Difference]: Finished difference Result 2023 states and 3143 transitions. [2022-02-20 18:53:32,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:53:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:53:32,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 866 transitions. [2022-02-20 18:53:32,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:33,036 INFO L225 Difference]: With dead ends: 2023 [2022-02-20 18:53:33,036 INFO L226 Difference]: Without dead ends: 1802 [2022-02-20 18:53:33,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:33,037 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 1040 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:33,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1040 Valid, 1305 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-02-20 18:53:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1112. [2022-02-20 18:53:33,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:33,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1802 states. Second operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:33,819 INFO L74 IsIncluded]: Start isIncluded. First operand 1802 states. Second operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:33,821 INFO L87 Difference]: Start difference. First operand 1802 states. Second operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:33,915 INFO L93 Difference]: Finished difference Result 1802 states and 2794 transitions. [2022-02-20 18:53:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2794 transitions. [2022-02-20 18:53:33,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:33,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:33,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 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 1802 states. [2022-02-20 18:53:33,924 INFO L87 Difference]: Start difference. First operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 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 1802 states. [2022-02-20 18:53:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:34,038 INFO L93 Difference]: Finished difference Result 1802 states and 2794 transitions. [2022-02-20 18:53:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2794 transitions. [2022-02-20 18:53:34,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:34,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:34,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:34,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 1.5445544554455446) internal successors, (1716), 1111 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1716 transitions. [2022-02-20 18:53:34,093 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1716 transitions. Word has length 77 [2022-02-20 18:53:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:34,093 INFO L470 AbstractCegarLoop]: Abstraction has 1112 states and 1716 transitions. [2022-02-20 18:53:34,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1716 transitions. [2022-02-20 18:53:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:34,094 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:34,094 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] [2022-02-20 18:53:34,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:53:34,095 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:34,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1856951880, now seen corresponding path program 1 times [2022-02-20 18:53:34,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:34,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385830302] [2022-02-20 18:53:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:34,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:34,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {26317#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {26317#true} is VALID [2022-02-20 18:53:34,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {26317#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {26317#true} is VALID [2022-02-20 18:53:34,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {26317#true} assume 0 == ~r1~0 % 256; {26317#true} is VALID [2022-02-20 18:53:34,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {26317#true} assume ~id1~0 >= 0; {26317#true} is VALID [2022-02-20 18:53:34,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {26317#true} assume 0 == ~st1~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {26319#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {26319#(<= ~st1~0 0)} assume ~id2~0 >= 0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~st2~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {26319#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {26319#(<= ~st1~0 0)} assume ~id3~0 >= 0; {26319#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:34,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {26319#(<= ~st1~0 0)} assume 0 == ~st3~0; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {26320#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {26320#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id5~0 >= 0; {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {26321#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,180 INFO L290 TraceCheckUtils]: 50: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 5); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,180 INFO L290 TraceCheckUtils]: 51: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:34,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {26322#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,184 INFO L290 TraceCheckUtils]: 63: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,185 INFO L290 TraceCheckUtils]: 66: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,186 INFO L290 TraceCheckUtils]: 67: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode5~0 := 0; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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;havoc main_~check__tmp~1#1; {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:53:34,188 INFO L290 TraceCheckUtils]: 73: Hoare triple {26323#(and (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {26318#false} is VALID [2022-02-20 18:53:34,188 INFO L290 TraceCheckUtils]: 74: Hoare triple {26318#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {26318#false} is VALID [2022-02-20 18:53:34,188 INFO L290 TraceCheckUtils]: 75: Hoare triple {26318#false} assume 0 == main_~assert__arg~1#1 % 256; {26318#false} is VALID [2022-02-20 18:53:34,188 INFO L290 TraceCheckUtils]: 76: Hoare triple {26318#false} assume !false; {26318#false} is VALID [2022-02-20 18:53:34,188 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:53:34,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:34,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385830302] [2022-02-20 18:53:34,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385830302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:34,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:34,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:34,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582756418] [2022-02-20 18:53:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:34,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:34,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:34,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:34,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:34,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:34,240 INFO L87 Difference]: Start difference. First operand 1112 states and 1716 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:36,873 INFO L93 Difference]: Finished difference Result 2253 states and 3504 transitions. [2022-02-20 18:53:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:53:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:53:36,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 866 transitions. [2022-02-20 18:53:37,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:37,367 INFO L225 Difference]: With dead ends: 2253 [2022-02-20 18:53:37,367 INFO L226 Difference]: Without dead ends: 2032 [2022-02-20 18:53:37,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:37,368 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1083 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:37,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1083 Valid, 1607 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-02-20 18:53:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1347. [2022-02-20 18:53:38,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:38,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2032 states. Second operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:38,550 INFO L74 IsIncluded]: Start isIncluded. First operand 2032 states. Second operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:38,551 INFO L87 Difference]: Start difference. First operand 2032 states. Second operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:38,715 INFO L93 Difference]: Finished difference Result 2032 states and 3155 transitions. [2022-02-20 18:53:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 3155 transitions. [2022-02-20 18:53:38,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:38,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:38,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 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 2032 states. [2022-02-20 18:53:38,721 INFO L87 Difference]: Start difference. First operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 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 2032 states. [2022-02-20 18:53:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:38,864 INFO L93 Difference]: Finished difference Result 2032 states and 3155 transitions. [2022-02-20 18:53:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 3155 transitions. [2022-02-20 18:53:38,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:38,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:38,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:38,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1346 states have (on average 1.549034175334324) internal successors, (2085), 1346 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2085 transitions. [2022-02-20 18:53:38,942 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2085 transitions. Word has length 77 [2022-02-20 18:53:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:38,942 INFO L470 AbstractCegarLoop]: Abstraction has 1347 states and 2085 transitions. [2022-02-20 18:53:38,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2085 transitions. [2022-02-20 18:53:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:53:38,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:38,943 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] [2022-02-20 18:53:38,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:53:38,944 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1646651862, now seen corresponding path program 1 times [2022-02-20 18:53:38,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:38,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198921090] [2022-02-20 18:53:38,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:39,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {35361#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {35361#true} is VALID [2022-02-20 18:53:39,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {35361#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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {35361#true} is VALID [2022-02-20 18:53:39,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {35361#true} assume 0 == ~r1~0 % 256; {35361#true} is VALID [2022-02-20 18:53:39,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {35361#true} assume ~id1~0 >= 0; {35361#true} is VALID [2022-02-20 18:53:39,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {35361#true} assume 0 == ~st1~0; {35361#true} is VALID [2022-02-20 18:53:39,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {35361#true} assume ~send1~0 == ~id1~0; {35361#true} is VALID [2022-02-20 18:53:39,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {35361#true} assume 0 == ~mode1~0 % 256; {35361#true} is VALID [2022-02-20 18:53:39,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {35361#true} assume ~id2~0 >= 0; {35361#true} is VALID [2022-02-20 18:53:39,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {35361#true} assume 0 == ~st2~0; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:39,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {35363#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:39,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {35363#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:39,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {35363#(<= ~st2~0 0)} assume ~id3~0 >= 0; {35363#(<= ~st2~0 0)} is VALID [2022-02-20 18:53:39,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {35363#(<= ~st2~0 0)} assume 0 == ~st3~0; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {35364#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {35364#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id5~0 >= 0; {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {35365#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send5~0 == ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode5~0 % 256; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,029 INFO L290 TraceCheckUtils]: 50: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 5); {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,030 INFO L290 TraceCheckUtils]: 51: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:53:39,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {35366#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node5__m5~1#1 != ~nomsg~0); {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} ~mode5~0 := 0; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~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;havoc main_~check__tmp~1#1; {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:53:39,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {35367#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {35362#false} is VALID [2022-02-20 18:53:39,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {35362#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {35362#false} is VALID [2022-02-20 18:53:39,038 INFO L290 TraceCheckUtils]: 75: Hoare triple {35362#false} assume 0 == main_~assert__arg~1#1 % 256; {35362#false} is VALID [2022-02-20 18:53:39,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {35362#false} assume !false; {35362#false} is VALID [2022-02-20 18:53:39,038 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:53:39,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:39,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198921090] [2022-02-20 18:53:39,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198921090] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:39,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:39,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:39,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745680490] [2022-02-20 18:53:39,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:39,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:39,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:39,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:39,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:39,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:39,091 INFO L87 Difference]: Start difference. First operand 1347 states and 2085 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:42,053 INFO L93 Difference]: Finished difference Result 2488 states and 3873 transitions. [2022-02-20 18:53:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:53:42,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 18:53:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:53:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-02-20 18:53:42,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 866 transitions. [2022-02-20 18:53:42,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:42,670 INFO L225 Difference]: With dead ends: 2488 [2022-02-20 18:53:42,670 INFO L226 Difference]: Without dead ends: 2267 [2022-02-20 18:53:42,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:53:42,671 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 1087 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:42,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 1265 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-02-20 18:53:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 1582. [2022-02-20 18:53:45,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:45,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2267 states. Second operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:45,500 INFO L74 IsIncluded]: Start isIncluded. First operand 2267 states. Second operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:45,502 INFO L87 Difference]: Start difference. First operand 2267 states. Second operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:45,653 INFO L93 Difference]: Finished difference Result 2267 states and 3524 transitions. [2022-02-20 18:53:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 3524 transitions. [2022-02-20 18:53:45,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:45,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:45,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 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 2267 states. [2022-02-20 18:53:45,659 INFO L87 Difference]: Start difference. First operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 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 2267 states. [2022-02-20 18:53:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:45,812 INFO L93 Difference]: Finished difference Result 2267 states and 3524 transitions. [2022-02-20 18:53:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 3524 transitions. [2022-02-20 18:53:45,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:45,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:45,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:45,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.5521821631878558) internal successors, (2454), 1581 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2454 transitions. [2022-02-20 18:53:45,926 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2454 transitions. Word has length 77 [2022-02-20 18:53:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:45,926 INFO L470 AbstractCegarLoop]: Abstraction has 1582 states and 2454 transitions. [2022-02-20 18:53:45,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2454 transitions. [2022-02-20 18:53:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:53:45,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:45,927 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] [2022-02-20 18:53:45,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:53:45,928 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1055850175, now seen corresponding path program 1 times [2022-02-20 18:53:45,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:45,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756049119] [2022-02-20 18:53:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:46,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {45527#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {45529#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:46,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {45529#(<= (+ ~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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {45529#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:46,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {45529#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {45529#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:46,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {45529#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {45530#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:46,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {45530#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {45530#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:53:46,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {45530#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {45531#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:53:46,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {45531#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {45528#false} is VALID [2022-02-20 18:53:46,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {45528#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {45528#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {45528#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {45528#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {45528#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {45528#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {45528#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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {45528#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {45528#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {45528#false} is VALID [2022-02-20 18:53:46,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {45528#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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {45528#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {45528#false} is VALID [2022-02-20 18:53:46,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {45528#false} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {45528#false} is VALID [2022-02-20 18:53:46,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {45528#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {45528#false} is VALID [2022-02-20 18:53:46,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {45528#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {45528#false} is VALID [2022-02-20 18:53:46,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {45528#false} assume !(~r1~0 % 256 >= 5); {45528#false} is VALID [2022-02-20 18:53:46,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {45528#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {45528#false} is VALID [2022-02-20 18:53:46,019 INFO L290 TraceCheckUtils]: 52: Hoare triple {45528#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 53: Hoare triple {45528#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 54: Hoare triple {45528#false} assume !(0 == ~mode1~0 % 256); {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {45528#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {45528#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {45528#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 58: Hoare triple {45528#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 59: Hoare triple {45528#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {45528#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {45528#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 62: Hoare triple {45528#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {45528#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {45528#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {45528#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {45528#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {45528#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {45528#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {45528#false} is VALID [2022-02-20 18:53:46,021 INFO L290 TraceCheckUtils]: 69: Hoare triple {45528#false} ~mode5~0 := 0; {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {45528#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;havoc main_~check__tmp~1#1; {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 71: Hoare triple {45528#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 72: Hoare triple {45528#false} assume !(~r1~0 % 256 >= 5); {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 73: Hoare triple {45528#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {45528#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {45528#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {45528#false} assume 0 == main_~assert__arg~1#1 % 256; {45528#false} is VALID [2022-02-20 18:53:46,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {45528#false} assume !false; {45528#false} is VALID [2022-02-20 18:53:46,023 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:53:46,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:46,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756049119] [2022-02-20 18:53:46,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756049119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:46,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:46,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:53:46,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913493240] [2022-02-20 18:53:46,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:46,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:46,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:46,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:46,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:53:46,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:46,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:53:46,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:53:46,065 INFO L87 Difference]: Start difference. First operand 1582 states and 2454 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:51,554 INFO L93 Difference]: Finished difference Result 4619 states and 7211 transitions. [2022-02-20 18:53:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:53:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:53:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-02-20 18:53:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-02-20 18:53:51,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 496 transitions. [2022-02-20 18:53:51,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:52,164 INFO L225 Difference]: With dead ends: 4619 [2022-02-20 18:53:52,164 INFO L226 Difference]: Without dead ends: 3074 [2022-02-20 18:53:52,192 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:53:52,194 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 805 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:53:52,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 180 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:53:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2022-02-20 18:53:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 3072. [2022-02-20 18:53:56,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:56,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3074 states. Second operand has 3072 states, 3071 states have (on average 1.552263106479974) internal successors, (4767), 3071 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:56,423 INFO L74 IsIncluded]: Start isIncluded. First operand 3074 states. Second operand has 3072 states, 3071 states have (on average 1.552263106479974) internal successors, (4767), 3071 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:56,426 INFO L87 Difference]: Start difference. First operand 3074 states. Second operand has 3072 states, 3071 states have (on average 1.552263106479974) internal successors, (4767), 3071 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:56,743 INFO L93 Difference]: Finished difference Result 3074 states and 4768 transitions. [2022-02-20 18:53:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4768 transitions. [2022-02-20 18:53:56,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:56,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:56,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 3072 states, 3071 states have (on average 1.552263106479974) internal successors, (4767), 3071 states have internal predecessors, (4767), 0 states have call successors, (0), 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 3074 states. [2022-02-20 18:53:56,772 INFO L87 Difference]: Start difference. First operand has 3072 states, 3071 states have (on average 1.552263106479974) internal successors, (4767), 3071 states have internal predecessors, (4767), 0 states have call successors, (0), 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 3074 states. [2022-02-20 18:53:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:57,079 INFO L93 Difference]: Finished difference Result 3074 states and 4768 transitions. [2022-02-20 18:53:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4768 transitions. [2022-02-20 18:53:57,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:57,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:57,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:57,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 1.552263106479974) internal successors, (4767), 3071 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4767 transitions. [2022-02-20 18:53:57,581 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4767 transitions. Word has length 78 [2022-02-20 18:53:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:57,581 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4767 transitions. [2022-02-20 18:53:57,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4767 transitions. [2022-02-20 18:53:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:53:57,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:57,582 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] [2022-02-20 18:53:57,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:53:57,583 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:57,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2025338944, now seen corresponding path program 1 times [2022-02-20 18:53:57,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:57,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970388709] [2022-02-20 18:53:57,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:57,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:57,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {62330#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {62332#(<= (+ ~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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {62332#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:53:57,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {62332#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {62333#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:53:57,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {62333#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {62333#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:53:57,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {62333#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send1~0 != ~nomsg~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,675 INFO L290 TraceCheckUtils]: 42: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} ~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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {62334#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 48: Hoare triple {62334#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {62331#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {62331#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {62331#false} assume !(~r1~0 % 256 >= 5); {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {62331#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {62331#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {62331#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {62331#false} assume !(0 == ~mode1~0 % 256); {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {62331#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {62331#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {62331#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {62331#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {62331#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {62331#false} is VALID [2022-02-20 18:53:57,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {62331#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {62331#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 63: Hoare triple {62331#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 64: Hoare triple {62331#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 65: Hoare triple {62331#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 66: Hoare triple {62331#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 67: Hoare triple {62331#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 68: Hoare triple {62331#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 69: Hoare triple {62331#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 70: Hoare triple {62331#false} ~mode5~0 := 0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 71: Hoare triple {62331#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;havoc main_~check__tmp~1#1; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 72: Hoare triple {62331#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {62331#false} assume !(~r1~0 % 256 >= 5); {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 74: Hoare triple {62331#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {62331#false} is VALID [2022-02-20 18:53:57,678 INFO L290 TraceCheckUtils]: 75: Hoare triple {62331#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {62331#false} is VALID [2022-02-20 18:53:57,679 INFO L290 TraceCheckUtils]: 76: Hoare triple {62331#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {62331#false} is VALID [2022-02-20 18:53:57,679 INFO L290 TraceCheckUtils]: 77: Hoare triple {62331#false} assume 0 == main_~assert__arg~1#1 % 256; {62331#false} is VALID [2022-02-20 18:53:57,679 INFO L290 TraceCheckUtils]: 78: Hoare triple {62331#false} assume !false; {62331#false} is VALID [2022-02-20 18:53:57,679 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:53:57,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:57,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970388709] [2022-02-20 18:53:57,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970388709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:57,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:57,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:53:57,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138033680] [2022-02-20 18:53:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:53:57,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:57,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:57,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:57,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:53:57,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:57,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:53:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:53:57,730 INFO L87 Difference]: Start difference. First operand 3072 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:04,167 INFO L93 Difference]: Finished difference Result 6091 states and 9477 transitions. [2022-02-20 18:54:04,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:04,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:54:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2022-02-20 18:54:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2022-02-20 18:54:04,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 345 transitions. [2022-02-20 18:54:04,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:04,671 INFO L225 Difference]: With dead ends: 6091 [2022-02-20 18:54:04,672 INFO L226 Difference]: Without dead ends: 3072 [2022-02-20 18:54:04,674 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:54:04,674 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 503 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:04,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 143 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-02-20 18:54:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2022-02-20 18:54:10,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:10,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3072 states. Second operand has 3072 states, 3071 states have (on average 1.5350048844024748) internal successors, (4714), 3071 states have internal predecessors, (4714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,019 INFO L74 IsIncluded]: Start isIncluded. First operand 3072 states. Second operand has 3072 states, 3071 states have (on average 1.5350048844024748) internal successors, (4714), 3071 states have internal predecessors, (4714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,020 INFO L87 Difference]: Start difference. First operand 3072 states. Second operand has 3072 states, 3071 states have (on average 1.5350048844024748) internal successors, (4714), 3071 states have internal predecessors, (4714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:10,284 INFO L93 Difference]: Finished difference Result 3072 states and 4714 transitions. [2022-02-20 18:54:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4714 transitions. [2022-02-20 18:54:10,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:10,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:10,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 3072 states, 3071 states have (on average 1.5350048844024748) internal successors, (4714), 3071 states have internal predecessors, (4714), 0 states have call successors, (0), 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 3072 states. [2022-02-20 18:54:10,291 INFO L87 Difference]: Start difference. First operand has 3072 states, 3071 states have (on average 1.5350048844024748) internal successors, (4714), 3071 states have internal predecessors, (4714), 0 states have call successors, (0), 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 3072 states. [2022-02-20 18:54:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:10,555 INFO L93 Difference]: Finished difference Result 3072 states and 4714 transitions. [2022-02-20 18:54:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4714 transitions. [2022-02-20 18:54:10,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:10,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:10,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:10,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 1.5350048844024748) internal successors, (4714), 3071 states have internal predecessors, (4714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4714 transitions. [2022-02-20 18:54:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4714 transitions. Word has length 79 [2022-02-20 18:54:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:10,982 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4714 transitions. [2022-02-20 18:54:10,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4714 transitions. [2022-02-20 18:54:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:54:10,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:10,983 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] [2022-02-20 18:54:10,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:54:10,984 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1784244513, now seen corresponding path program 1 times [2022-02-20 18:54:10,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:10,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459008754] [2022-02-20 18:54:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:11,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {81181#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {81183#(<= (+ ~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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {81183#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:11,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {81183#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {81184#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:11,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {81184#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {81184#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:54:11,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {81184#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {81185#(<= (+ ~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {81185#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:54:11,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {81185#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {81182#false} is VALID [2022-02-20 18:54:11,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {81182#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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {81182#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {81182#false} is VALID [2022-02-20 18:54:11,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {81182#false} assume ~send5~0 != ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {81182#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {81182#false} is VALID [2022-02-20 18:54:11,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {81182#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {81182#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {81182#false} assume !(~r1~0 % 256 >= 5); {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {81182#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {81182#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {81182#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {81182#false} assume !(0 == ~mode1~0 % 256); {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {81182#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {81182#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {81182#false} is VALID [2022-02-20 18:54:11,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {81182#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {81182#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {81182#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {81182#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {81182#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {81182#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 65: Hoare triple {81182#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {81182#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {81182#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {81182#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {81182#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {81182#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 71: Hoare triple {81182#false} ~mode5~0 := 0; {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 72: Hoare triple {81182#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;havoc main_~check__tmp~1#1; {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 73: Hoare triple {81182#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 74: Hoare triple {81182#false} assume !(~r1~0 % 256 >= 5); {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 75: Hoare triple {81182#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {81182#false} is VALID [2022-02-20 18:54:11,056 INFO L290 TraceCheckUtils]: 76: Hoare triple {81182#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {81182#false} is VALID [2022-02-20 18:54:11,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {81182#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {81182#false} is VALID [2022-02-20 18:54:11,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {81182#false} assume 0 == main_~assert__arg~1#1 % 256; {81182#false} is VALID [2022-02-20 18:54:11,057 INFO L290 TraceCheckUtils]: 79: Hoare triple {81182#false} assume !false; {81182#false} is VALID [2022-02-20 18:54:11,057 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:54:11,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:11,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459008754] [2022-02-20 18:54:11,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459008754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:11,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:11,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:11,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946996043] [2022-02-20 18:54:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:54:11,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:11,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:11,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:11,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:11,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:11,106 INFO L87 Difference]: Start difference. First operand 3072 states and 4714 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:17,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:17,870 INFO L93 Difference]: Finished difference Result 6095 states and 9376 transitions. [2022-02-20 18:54:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:17,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:54:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2022-02-20 18:54:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2022-02-20 18:54:17,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 346 transitions. [2022-02-20 18:54:18,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:18,392 INFO L225 Difference]: With dead ends: 6095 [2022-02-20 18:54:18,392 INFO L226 Difference]: Without dead ends: 3072 [2022-02-20 18:54:18,394 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:54:18,395 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 508 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:18,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 135 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-02-20 18:54:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2022-02-20 18:54:24,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:24,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3072 states. Second operand has 3072 states, 3071 states have (on average 1.5177466623249756) internal successors, (4661), 3071 states have internal predecessors, (4661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,414 INFO L74 IsIncluded]: Start isIncluded. First operand 3072 states. Second operand has 3072 states, 3071 states have (on average 1.5177466623249756) internal successors, (4661), 3071 states have internal predecessors, (4661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,415 INFO L87 Difference]: Start difference. First operand 3072 states. Second operand has 3072 states, 3071 states have (on average 1.5177466623249756) internal successors, (4661), 3071 states have internal predecessors, (4661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:24,674 INFO L93 Difference]: Finished difference Result 3072 states and 4661 transitions. [2022-02-20 18:54:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4661 transitions. [2022-02-20 18:54:24,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:24,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:24,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 3072 states, 3071 states have (on average 1.5177466623249756) internal successors, (4661), 3071 states have internal predecessors, (4661), 0 states have call successors, (0), 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 3072 states. [2022-02-20 18:54:24,682 INFO L87 Difference]: Start difference. First operand has 3072 states, 3071 states have (on average 1.5177466623249756) internal successors, (4661), 3071 states have internal predecessors, (4661), 0 states have call successors, (0), 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 3072 states. [2022-02-20 18:54:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:24,949 INFO L93 Difference]: Finished difference Result 3072 states and 4661 transitions. [2022-02-20 18:54:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4661 transitions. [2022-02-20 18:54:24,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:24,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:24,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:24,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 1.5177466623249756) internal successors, (4661), 3071 states have internal predecessors, (4661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4661 transitions. [2022-02-20 18:54:25,380 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4661 transitions. Word has length 80 [2022-02-20 18:54:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:25,380 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4661 transitions. [2022-02-20 18:54:25,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4661 transitions. [2022-02-20 18:54:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:54:25,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:25,381 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] [2022-02-20 18:54:25,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:54:25,381 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -511041836, now seen corresponding path program 1 times [2022-02-20 18:54:25,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:25,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415856489] [2022-02-20 18:54:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:25,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {100037#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~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];~__return_6164~0 := 0;~__return_6273~0 := 0;~__return_6465~0 := 0; {100039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:25,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {100039#(<= (+ ~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_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#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;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {100039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:25,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {100039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {100039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:25,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {100039#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {100039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:25,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {100039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {100039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:25,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {100039#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {100039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:25,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {100039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {100039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:25,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {100039#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {100040#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:25,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {100040#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {100040#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:54:25,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {100040#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6164~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6164~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {100041#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {100041#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {100038#false} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {100038#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {100038#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {100038#false} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {100038#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {100038#false} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {100038#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);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 44: Hoare triple {100038#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {100038#false} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 45: Hoare triple {100038#false} assume ~send4~0 != ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,454 INFO L290 TraceCheckUtils]: 46: Hoare triple {100038#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {100038#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);~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {100038#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {100038#false} assume ~send5~0 != ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {100038#false} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {100038#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~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;havoc main_~check__tmp~0#1; {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {100038#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {100038#false} assume !(~r1~0 % 256 >= 5); {100038#false} is VALID [2022-02-20 18:54:25,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {100038#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {100038#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_6273~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6273~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; {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {100038#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {100038#false} assume !(0 == ~mode1~0 % 256); {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {100038#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 59: Hoare triple {100038#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 60: Hoare triple {100038#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {100038#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {100038#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {100038#false} is VALID [2022-02-20 18:54:25,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {100038#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {100038#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {100038#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {100038#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {100038#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {100038#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {100038#false} ~mode4~0 := 0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {100038#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {100038#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {100038#false} is VALID [2022-02-20 18:54:25,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {100038#false} ~mode5~0 := 0; {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {100038#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;havoc main_~check__tmp~1#1; {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {100038#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 75: Hoare triple {100038#false} assume !(~r1~0 % 256 >= 5); {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 76: Hoare triple {100038#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 77: Hoare triple {100038#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 78: Hoare triple {100038#false} ~__return_6465~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6465~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; {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 79: Hoare triple {100038#false} assume 0 == main_~assert__arg~1#1 % 256; {100038#false} is VALID [2022-02-20 18:54:25,458 INFO L290 TraceCheckUtils]: 80: Hoare triple {100038#false} assume !false; {100038#false} is VALID [2022-02-20 18:54:25,459 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:54:25,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:25,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415856489] [2022-02-20 18:54:25,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415856489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:25,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:25,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:25,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293494972] [2022-02-20 18:54:25,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:25,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:54:25,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:25,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:25,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:25,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:25,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:25,509 INFO L87 Difference]: Start difference. First operand 3072 states and 4661 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)