./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-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.6.1.ufo.UNBOUNDED.pals.c.v+cfa-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 9475964eaf3c99c585f18d5c2e0c0a26c1a8a589a644152df77fbb74995f4153 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:54:37,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:54:37,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:54:38,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:54:38,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:54:38,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:54:38,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:54:38,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:54:38,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:54:38,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:54:38,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:54:38,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:54:38,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:54:38,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:54:38,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:54:38,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:54:38,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:54:38,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:54:38,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:54:38,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:54:38,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:54:38,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:54:38,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:54:38,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:54:38,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:54:38,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:54:38,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:54:38,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:54:38,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:54:38,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:54:38,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:54:38,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:54:38,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:54:38,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:54:38,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:54:38,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:54:38,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:54:38,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:54:38,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:54:38,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:54:38,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:54:38,087 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:54:38,122 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:54:38,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:54:38,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:54:38,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:54:38,124 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:54:38,124 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:54:38,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:54:38,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:54:38,125 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:54:38,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:54:38,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:54:38,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:54:38,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:54:38,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:54:38,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:54:38,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:54:38,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:54:38,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:54:38,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:54:38,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:54:38,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:54:38,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:54:38,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:54:38,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:54:38,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:54:38,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:54:38,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:54:38,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:54:38,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:54:38,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:54:38,130 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:54:38,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:54:38,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:54:38,130 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 -> 9475964eaf3c99c585f18d5c2e0c0a26c1a8a589a644152df77fbb74995f4153 [2022-02-20 18:54:38,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:54:38,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:54:38,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:54:38,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:54:38,392 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:54:38,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:54:38,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b462a4cc4/54846313768d489998849ae97226a90d/FLAGf853a5921 [2022-02-20 18:54:38,907 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:54:38,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:54:38,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b462a4cc4/54846313768d489998849ae97226a90d/FLAGf853a5921 [2022-02-20 18:54:39,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b462a4cc4/54846313768d489998849ae97226a90d [2022-02-20 18:54:39,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:54:39,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:54:39,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:54:39,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:54:39,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:54:39,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec881c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39, skipping insertion in model container [2022-02-20 18:54:39,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:54:39,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:54:39,694 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.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6732,6745] [2022-02-20 18:54:39,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:54:39,752 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:54:39,797 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.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6732,6745] [2022-02-20 18:54:39,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:54:39,845 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:54:39,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39 WrapperNode [2022-02-20 18:54:39,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:54:39,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:54:39,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:54:39,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:54:39,854 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:54:39" (1/1) ... [2022-02-20 18:54:39,873 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:54:39" (1/1) ... [2022-02-20 18:54:39,927 INFO L137 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 492 [2022-02-20 18:54:39,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:54:39,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:54:39,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:54:39,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:54:39,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:54:39,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:54:39,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:54:39,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:54:39,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (1/1) ... [2022-02-20 18:54:39,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:54:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:54:40,011 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:54:40,026 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:54:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:54:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:54:40,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:54:40,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:54:40,141 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:54:40,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:54:40,820 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:54:40,832 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:54:40,832 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:54:40,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:54:40 BoogieIcfgContainer [2022-02-20 18:54:40,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:54:40,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:54:40,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:54:40,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:54:40,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:54:39" (1/3) ... [2022-02-20 18:54:40,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494e82a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:54:40, skipping insertion in model container [2022-02-20 18:54:40,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:39" (2/3) ... [2022-02-20 18:54:40,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494e82a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:54:40, skipping insertion in model container [2022-02-20 18:54:40,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:54:40" (3/3) ... [2022-02-20 18:54:40,844 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:54:40,848 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:54:40,848 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:54:40,909 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:54:40,917 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:54:40,917 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:54:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 117 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call 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:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:54:40,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:40,965 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] [2022-02-20 18:54:40,966 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1122612567, now seen corresponding path program 1 times [2022-02-20 18:54:40,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:40,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104643054] [2022-02-20 18:54:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:41,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_13205~0 := 0;~__return_13338~0 := 0; {121#true} is VALID [2022-02-20 18:54:41,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_~init__tmp~0#1; {121#true} is VALID [2022-02-20 18:54:41,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#true} assume 0 == ~r1~0 % 256; {121#true} is VALID [2022-02-20 18:54:41,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#true} assume ~id1~0 >= 0; {121#true} is VALID [2022-02-20 18:54:41,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#true} assume 0 == ~st1~0; {121#true} is VALID [2022-02-20 18:54:41,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {121#true} assume ~send1~0 == ~id1~0; {121#true} is VALID [2022-02-20 18:54:41,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {121#true} assume 0 == ~mode1~0 % 256; {121#true} is VALID [2022-02-20 18:54:41,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {121#true} assume ~id2~0 >= 0; {121#true} is VALID [2022-02-20 18:54:41,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#true} assume 0 == ~st2~0; {121#true} is VALID [2022-02-20 18:54:41,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {121#true} assume ~send2~0 == ~id2~0; {121#true} is VALID [2022-02-20 18:54:41,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#true} assume 0 == ~mode2~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13205~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13205~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:41,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {123#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {122#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:54:41,456 INFO L290 TraceCheckUtils]: 51: Hoare triple {122#false} ~mode2~0 := 0; {122#false} is VALID [2022-02-20 18:54:41,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {122#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {122#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,457 INFO L290 TraceCheckUtils]: 54: Hoare triple {122#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:54:41,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {122#false} ~mode3~0 := 0; {122#false} is VALID [2022-02-20 18:54:41,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {122#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,458 INFO L290 TraceCheckUtils]: 57: Hoare triple {122#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,459 INFO L290 TraceCheckUtils]: 58: Hoare triple {122#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:54:41,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {122#false} ~mode4~0 := 0; {122#false} is VALID [2022-02-20 18:54:41,460 INFO L290 TraceCheckUtils]: 60: Hoare triple {122#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {122#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {122#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:54:41,461 INFO L290 TraceCheckUtils]: 63: Hoare triple {122#false} ~mode5~0 := 0; {122#false} is VALID [2022-02-20 18:54:41,461 INFO L290 TraceCheckUtils]: 64: Hoare triple {122#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,461 INFO L290 TraceCheckUtils]: 65: Hoare triple {122#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {122#false} is VALID [2022-02-20 18:54:41,461 INFO L290 TraceCheckUtils]: 66: Hoare triple {122#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {122#false} is VALID [2022-02-20 18:54:41,462 INFO L290 TraceCheckUtils]: 67: Hoare triple {122#false} ~mode6~0 := 0; {122#false} is VALID [2022-02-20 18:54:41,462 INFO L290 TraceCheckUtils]: 68: Hoare triple {122#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {122#false} is VALID [2022-02-20 18:54:41,463 INFO L290 TraceCheckUtils]: 69: Hoare triple {122#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {122#false} is VALID [2022-02-20 18:54:41,464 INFO L290 TraceCheckUtils]: 70: Hoare triple {122#false} ~__return_13338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13338~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; {122#false} is VALID [2022-02-20 18:54:41,464 INFO L290 TraceCheckUtils]: 71: Hoare triple {122#false} assume 0 == main_~assert__arg~0#1 % 256; {122#false} is VALID [2022-02-20 18:54:41,464 INFO L290 TraceCheckUtils]: 72: Hoare triple {122#false} assume !false; {122#false} is VALID [2022-02-20 18:54:41,468 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:41,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:41,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104643054] [2022-02-20 18:54:41,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104643054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:41,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:41,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:41,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913764283] [2022-02-20 18:54:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:41,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:54:41,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:41,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call 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:41,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:41,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:41,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:41,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:41,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:41,606 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.7327586206896552) internal successors, (201), 117 states have internal predecessors, (201), 0 states have call successors, (0), 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 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call 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:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:41,975 INFO L93 Difference]: Finished difference Result 260 states and 422 transitions. [2022-02-20 18:54:41,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:41,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:54:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call 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:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2022-02-20 18:54:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call 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:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2022-02-20 18:54:41,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 422 transitions. [2022-02-20 18:54:42,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:42,375 INFO L225 Difference]: With dead ends: 260 [2022-02-20 18:54:42,375 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 18:54:42,378 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:54:42,381 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 133 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:42,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 403 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 18:54:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-02-20 18:54:42,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:42,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:42,422 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:42,423 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:42,433 INFO L93 Difference]: Finished difference Result 179 states and 257 transitions. [2022-02-20 18:54:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 257 transitions. [2022-02-20 18:54:42,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:42,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 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 179 states. [2022-02-20 18:54:42,436 INFO L87 Difference]: Start difference. First operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 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 179 states. [2022-02-20 18:54:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:42,444 INFO L93 Difference]: Finished difference Result 179 states and 257 transitions. [2022-02-20 18:54:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 257 transitions. [2022-02-20 18:54:42,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:42,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:42,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:42,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call 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:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2022-02-20 18:54:42,455 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 73 [2022-02-20 18:54:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:42,456 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2022-02-20 18:54:42,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call 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:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2022-02-20 18:54:42,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:54:42,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:42,458 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] [2022-02-20 18:54:42,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:54:42,459 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1622464055, now seen corresponding path program 1 times [2022-02-20 18:54:42,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:42,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461934710] [2022-02-20 18:54:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:42,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {1058#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_13205~0 := 0;~__return_13338~0 := 0; {1058#true} is VALID [2022-02-20 18:54:42,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {1058#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_~init__tmp~0#1; {1058#true} is VALID [2022-02-20 18:54:42,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1058#true} assume 0 == ~r1~0 % 256; {1058#true} is VALID [2022-02-20 18:54:42,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {1058#true} assume ~id1~0 >= 0; {1058#true} is VALID [2022-02-20 18:54:42,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#true} assume 0 == ~st1~0; {1058#true} is VALID [2022-02-20 18:54:42,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#true} assume ~send1~0 == ~id1~0; {1058#true} is VALID [2022-02-20 18:54:42,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#true} assume 0 == ~mode1~0 % 256; {1058#true} is VALID [2022-02-20 18:54:42,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1058#true} assume ~id2~0 >= 0; {1058#true} is VALID [2022-02-20 18:54:42,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {1058#true} assume 0 == ~st2~0; {1058#true} is VALID [2022-02-20 18:54:42,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {1058#true} assume ~send2~0 == ~id2~0; {1058#true} is VALID [2022-02-20 18:54:42,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {1058#true} assume 0 == ~mode2~0 % 256; {1058#true} is VALID [2022-02-20 18:54:42,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {1058#true} assume ~id3~0 >= 0; {1058#true} is VALID [2022-02-20 18:54:42,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {1058#true} assume 0 == ~st3~0; {1058#true} is VALID [2022-02-20 18:54:42,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#true} assume ~send3~0 == ~id3~0; {1058#true} is VALID [2022-02-20 18:54:42,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {1058#true} assume 0 == ~mode3~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13205~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13205~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,583 INFO L290 TraceCheckUtils]: 43: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,585 INFO L290 TraceCheckUtils]: 47: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:42,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {1060#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:54:42,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {1059#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:54:42,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {1059#false} ~mode3~0 := 0; {1059#false} is VALID [2022-02-20 18:54:42,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {1059#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:54:42,590 INFO L290 TraceCheckUtils]: 58: Hoare triple {1059#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:54:42,590 INFO L290 TraceCheckUtils]: 59: Hoare triple {1059#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:54:42,590 INFO L290 TraceCheckUtils]: 60: Hoare triple {1059#false} ~mode4~0 := 0; {1059#false} is VALID [2022-02-20 18:54:42,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {1059#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:54:42,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {1059#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:54:42,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {1059#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:54:42,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {1059#false} ~mode5~0 := 0; {1059#false} is VALID [2022-02-20 18:54:42,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {1059#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:54:42,591 INFO L290 TraceCheckUtils]: 66: Hoare triple {1059#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-20 18:54:42,592 INFO L290 TraceCheckUtils]: 67: Hoare triple {1059#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-20 18:54:42,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {1059#false} ~mode6~0 := 0; {1059#false} is VALID [2022-02-20 18:54:42,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {1059#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1059#false} is VALID [2022-02-20 18:54:42,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {1059#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {1059#false} is VALID [2022-02-20 18:54:42,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {1059#false} ~__return_13338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13338~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; {1059#false} is VALID [2022-02-20 18:54:42,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {1059#false} assume 0 == main_~assert__arg~0#1 % 256; {1059#false} is VALID [2022-02-20 18:54:42,593 INFO L290 TraceCheckUtils]: 73: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2022-02-20 18:54:42,594 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:42,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:42,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461934710] [2022-02-20 18:54:42,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461934710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:42,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:42,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:42,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138302167] [2022-02-20 18:54:42,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:42,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:54:42,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:42,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:42,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:42,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:42,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:42,667 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:42,916 INFO L93 Difference]: Finished difference Result 429 states and 656 transitions. [2022-02-20 18:54:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:42,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:54:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:42,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:54:43,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:43,219 INFO L225 Difference]: With dead ends: 429 [2022-02-20 18:54:43,219 INFO L226 Difference]: Without dead ends: 295 [2022-02-20 18:54:43,220 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:54:43,221 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 94 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:43,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-02-20 18:54:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-02-20 18:54:43,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:43,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call 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:43,259 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call 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:43,260 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call 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:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:43,270 INFO L93 Difference]: Finished difference Result 295 states and 441 transitions. [2022-02-20 18:54:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 441 transitions. [2022-02-20 18:54:43,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:43,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:43,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 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 295 states. [2022-02-20 18:54:43,274 INFO L87 Difference]: Start difference. First operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 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 295 states. [2022-02-20 18:54:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:43,285 INFO L93 Difference]: Finished difference Result 295 states and 441 transitions. [2022-02-20 18:54:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 441 transitions. [2022-02-20 18:54:43,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:43,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:43,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:43,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 292 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call 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:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 440 transitions. [2022-02-20 18:54:43,298 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 440 transitions. Word has length 74 [2022-02-20 18:54:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:43,299 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 440 transitions. [2022-02-20 18:54:43,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call 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:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 440 transitions. [2022-02-20 18:54:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:54:43,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:43,301 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:54:43,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:54:43,301 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash 549627260, now seen corresponding path program 1 times [2022-02-20 18:54:43,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:43,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057012459] [2022-02-20 18:54:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:43,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {2628#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_13205~0 := 0;~__return_13338~0 := 0; {2628#true} is VALID [2022-02-20 18:54:43,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {2628#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_~init__tmp~0#1; {2628#true} is VALID [2022-02-20 18:54:43,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {2628#true} assume 0 == ~r1~0 % 256; {2628#true} is VALID [2022-02-20 18:54:43,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {2628#true} assume ~id1~0 >= 0; {2628#true} is VALID [2022-02-20 18:54:43,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {2628#true} assume 0 == ~st1~0; {2628#true} is VALID [2022-02-20 18:54:43,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {2628#true} assume ~send1~0 == ~id1~0; {2628#true} is VALID [2022-02-20 18:54:43,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {2628#true} assume 0 == ~mode1~0 % 256; {2628#true} is VALID [2022-02-20 18:54:43,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {2628#true} assume ~id2~0 >= 0; {2628#true} is VALID [2022-02-20 18:54:43,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {2628#true} assume 0 == ~st2~0; {2628#true} is VALID [2022-02-20 18:54:43,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {2628#true} assume ~send2~0 == ~id2~0; {2628#true} is VALID [2022-02-20 18:54:43,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {2628#true} assume 0 == ~mode2~0 % 256; {2628#true} is VALID [2022-02-20 18:54:43,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {2628#true} assume ~id3~0 >= 0; {2628#true} is VALID [2022-02-20 18:54:43,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {2628#true} assume 0 == ~st3~0; {2628#true} is VALID [2022-02-20 18:54:43,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {2628#true} assume ~send3~0 == ~id3~0; {2628#true} is VALID [2022-02-20 18:54:43,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {2628#true} assume 0 == ~mode3~0 % 256; {2628#true} is VALID [2022-02-20 18:54:43,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {2628#true} assume ~id4~0 >= 0; {2628#true} is VALID [2022-02-20 18:54:43,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {2628#true} assume 0 == ~st4~0; {2628#true} is VALID [2022-02-20 18:54:43,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {2628#true} assume ~send4~0 == ~id4~0; {2628#true} is VALID [2022-02-20 18:54:43,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {2628#true} assume 0 == ~mode4~0 % 256; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,399 INFO L290 TraceCheckUtils]: 32: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13205~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13205~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,412 INFO L290 TraceCheckUtils]: 55: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:43,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {2630#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:54:43,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {2629#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2629#false} is VALID [2022-02-20 18:54:43,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {2629#false} ~mode4~0 := 0; {2629#false} is VALID [2022-02-20 18:54:43,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {2629#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:54:43,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {2629#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:54:43,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {2629#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {2629#false} is VALID [2022-02-20 18:54:43,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {2629#false} ~mode5~0 := 0; {2629#false} is VALID [2022-02-20 18:54:43,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {2629#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:54:43,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {2629#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2629#false} is VALID [2022-02-20 18:54:43,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {2629#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {2629#false} is VALID [2022-02-20 18:54:43,418 INFO L290 TraceCheckUtils]: 69: Hoare triple {2629#false} ~mode6~0 := 0; {2629#false} is VALID [2022-02-20 18:54:43,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {2629#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2629#false} is VALID [2022-02-20 18:54:43,419 INFO L290 TraceCheckUtils]: 71: Hoare triple {2629#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {2629#false} is VALID [2022-02-20 18:54:43,419 INFO L290 TraceCheckUtils]: 72: Hoare triple {2629#false} ~__return_13338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13338~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; {2629#false} is VALID [2022-02-20 18:54:43,419 INFO L290 TraceCheckUtils]: 73: Hoare triple {2629#false} assume 0 == main_~assert__arg~0#1 % 256; {2629#false} is VALID [2022-02-20 18:54:43,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {2629#false} assume !false; {2629#false} is VALID [2022-02-20 18:54:43,420 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:43,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:43,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057012459] [2022-02-20 18:54:43,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057012459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:43,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:43,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:43,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756300348] [2022-02-20 18:54:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:54:43,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:43,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:54:43,479 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:54:43,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:43,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:43,480 INFO L87 Difference]: Start difference. First operand 293 states and 440 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:54:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:43,772 INFO L93 Difference]: Finished difference Result 761 states and 1182 transitions. [2022-02-20 18:54:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:54:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:54:43,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:54:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:43,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:54:44,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:44,068 INFO L225 Difference]: With dead ends: 761 [2022-02-20 18:54:44,068 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:54:44,070 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:54:44,071 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 89 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:44,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:54:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 509. [2022-02-20 18:54:44,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:44,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call 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:44,106 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call 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:44,108 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call 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:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:44,127 INFO L93 Difference]: Finished difference Result 511 states and 781 transitions. [2022-02-20 18:54:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 781 transitions. [2022-02-20 18:54:44,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:44,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:44,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:54:44,131 INFO L87 Difference]: Start difference. First operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:54:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:44,151 INFO L93 Difference]: Finished difference Result 511 states and 781 transitions. [2022-02-20 18:54:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 781 transitions. [2022-02-20 18:54:44,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:44,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:44,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:44,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.5354330708661417) internal successors, (780), 508 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call 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:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 780 transitions. [2022-02-20 18:54:44,175 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 780 transitions. Word has length 75 [2022-02-20 18:54:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:44,176 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 780 transitions. [2022-02-20 18:54:44,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:54:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 780 transitions. [2022-02-20 18:54:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:54:44,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:44,177 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] [2022-02-20 18:54:44,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:54:44,178 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1347673334, now seen corresponding path program 1 times [2022-02-20 18:54:44,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:44,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450191768] [2022-02-20 18:54:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:44,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:44,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {5401#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_13205~0 := 0;~__return_13338~0 := 0; {5401#true} is VALID [2022-02-20 18:54:44,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {5401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_~init__tmp~0#1; {5401#true} is VALID [2022-02-20 18:54:44,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {5401#true} assume 0 == ~r1~0 % 256; {5401#true} is VALID [2022-02-20 18:54:44,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {5401#true} assume ~id1~0 >= 0; {5401#true} is VALID [2022-02-20 18:54:44,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {5401#true} assume 0 == ~st1~0; {5401#true} is VALID [2022-02-20 18:54:44,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {5401#true} assume ~send1~0 == ~id1~0; {5401#true} is VALID [2022-02-20 18:54:44,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {5401#true} assume 0 == ~mode1~0 % 256; {5401#true} is VALID [2022-02-20 18:54:44,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {5401#true} assume ~id2~0 >= 0; {5401#true} is VALID [2022-02-20 18:54:44,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {5401#true} assume 0 == ~st2~0; {5401#true} is VALID [2022-02-20 18:54:44,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {5401#true} assume ~send2~0 == ~id2~0; {5401#true} is VALID [2022-02-20 18:54:44,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {5401#true} assume 0 == ~mode2~0 % 256; {5401#true} is VALID [2022-02-20 18:54:44,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {5401#true} assume ~id3~0 >= 0; {5401#true} is VALID [2022-02-20 18:54:44,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {5401#true} assume 0 == ~st3~0; {5401#true} is VALID [2022-02-20 18:54:44,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {5401#true} assume ~send3~0 == ~id3~0; {5401#true} is VALID [2022-02-20 18:54:44,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {5401#true} assume 0 == ~mode3~0 % 256; {5401#true} is VALID [2022-02-20 18:54:44,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {5401#true} assume ~id4~0 >= 0; {5401#true} is VALID [2022-02-20 18:54:44,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {5401#true} assume 0 == ~st4~0; {5401#true} is VALID [2022-02-20 18:54:44,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {5401#true} assume ~send4~0 == ~id4~0; {5401#true} is VALID [2022-02-20 18:54:44,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {5401#true} assume 0 == ~mode4~0 % 256; {5401#true} is VALID [2022-02-20 18:54:44,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {5401#true} assume ~id5~0 >= 0; {5401#true} is VALID [2022-02-20 18:54:44,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {5401#true} assume 0 == ~st5~0; {5401#true} is VALID [2022-02-20 18:54:44,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {5401#true} assume ~send5~0 == ~id5~0; {5401#true} is VALID [2022-02-20 18:54:44,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {5401#true} assume 0 == ~mode5~0 % 256; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13205~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13205~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,356 INFO L290 TraceCheckUtils]: 47: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0); {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0); {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,364 INFO L290 TraceCheckUtils]: 63: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 64: Hoare triple {5403#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {5402#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {5402#false} ~mode5~0 := 0; {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 67: Hoare triple {5402#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {5402#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {5402#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {5402#false} ~mode6~0 := 0; {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 71: Hoare triple {5402#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 72: Hoare triple {5402#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {5402#false} is VALID [2022-02-20 18:54:44,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {5402#false} ~__return_13338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13338~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; {5402#false} is VALID [2022-02-20 18:54:44,366 INFO L290 TraceCheckUtils]: 74: Hoare triple {5402#false} assume 0 == main_~assert__arg~0#1 % 256; {5402#false} is VALID [2022-02-20 18:54:44,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {5402#false} assume !false; {5402#false} is VALID [2022-02-20 18:54:44,366 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:44,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:44,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450191768] [2022-02-20 18:54:44,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450191768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:44,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:44,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:44,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641634325] [2022-02-20 18:54:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:54:44,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:44,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:44,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:44,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:44,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:44,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:44,429 INFO L87 Difference]: Start difference. First operand 509 states and 780 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:44,790 INFO L93 Difference]: Finished difference Result 1377 states and 2150 transitions. [2022-02-20 18:54:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:44,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:54:44,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:44,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:54:45,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:45,120 INFO L225 Difference]: With dead ends: 1377 [2022-02-20 18:54:45,120 INFO L226 Difference]: Without dead ends: 911 [2022-02-20 18:54:45,121 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:54:45,122 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 84 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:45,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-02-20 18:54:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 909. [2022-02-20 18:54:45,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:45,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 911 states. Second operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call 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:45,181 INFO L74 IsIncluded]: Start isIncluded. First operand 911 states. Second operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call 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:45,183 INFO L87 Difference]: Start difference. First operand 911 states. Second operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call 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:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:45,225 INFO L93 Difference]: Finished difference Result 911 states and 1405 transitions. [2022-02-20 18:54:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1405 transitions. [2022-02-20 18:54:45,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:45,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:45,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 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 911 states. [2022-02-20 18:54:45,239 INFO L87 Difference]: Start difference. First operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 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 911 states. [2022-02-20 18:54:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:45,283 INFO L93 Difference]: Finished difference Result 911 states and 1405 transitions. [2022-02-20 18:54:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1405 transitions. [2022-02-20 18:54:45,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:45,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:45,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:45,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.5462555066079295) internal successors, (1404), 908 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call 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:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1404 transitions. [2022-02-20 18:54:45,338 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1404 transitions. Word has length 76 [2022-02-20 18:54:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:45,338 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1404 transitions. [2022-02-20 18:54:45,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call 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:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1404 transitions. [2022-02-20 18:54:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:54:45,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:45,339 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:54:45,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:54:45,340 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1762980839, now seen corresponding path program 1 times [2022-02-20 18:54:45,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:45,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548973390] [2022-02-20 18:54:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:45,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:45,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {10406#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_13205~0 := 0;~__return_13338~0 := 0; {10406#true} is VALID [2022-02-20 18:54:45,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {10406#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_~init__tmp~0#1; {10406#true} is VALID [2022-02-20 18:54:45,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {10406#true} assume 0 == ~r1~0 % 256; {10406#true} is VALID [2022-02-20 18:54:45,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {10406#true} assume ~id1~0 >= 0; {10406#true} is VALID [2022-02-20 18:54:45,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {10406#true} assume 0 == ~st1~0; {10406#true} is VALID [2022-02-20 18:54:45,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {10406#true} assume ~send1~0 == ~id1~0; {10406#true} is VALID [2022-02-20 18:54:45,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {10406#true} assume 0 == ~mode1~0 % 256; {10406#true} is VALID [2022-02-20 18:54:45,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {10406#true} assume ~id2~0 >= 0; {10406#true} is VALID [2022-02-20 18:54:45,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {10406#true} assume 0 == ~st2~0; {10406#true} is VALID [2022-02-20 18:54:45,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {10406#true} assume ~send2~0 == ~id2~0; {10406#true} is VALID [2022-02-20 18:54:45,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {10406#true} assume 0 == ~mode2~0 % 256; {10406#true} is VALID [2022-02-20 18:54:45,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {10406#true} assume ~id3~0 >= 0; {10406#true} is VALID [2022-02-20 18:54:45,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {10406#true} assume 0 == ~st3~0; {10406#true} is VALID [2022-02-20 18:54:45,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {10406#true} assume ~send3~0 == ~id3~0; {10406#true} is VALID [2022-02-20 18:54:45,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {10406#true} assume 0 == ~mode3~0 % 256; {10406#true} is VALID [2022-02-20 18:54:45,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {10406#true} assume ~id4~0 >= 0; {10406#true} is VALID [2022-02-20 18:54:45,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {10406#true} assume 0 == ~st4~0; {10406#true} is VALID [2022-02-20 18:54:45,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {10406#true} assume ~send4~0 == ~id4~0; {10406#true} is VALID [2022-02-20 18:54:45,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {10406#true} assume 0 == ~mode4~0 % 256; {10406#true} is VALID [2022-02-20 18:54:45,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {10406#true} assume ~id5~0 >= 0; {10406#true} is VALID [2022-02-20 18:54:45,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {10406#true} assume 0 == ~st5~0; {10406#true} is VALID [2022-02-20 18:54:45,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {10406#true} assume ~send5~0 == ~id5~0; {10406#true} is VALID [2022-02-20 18:54:45,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {10406#true} assume 0 == ~mode5~0 % 256; {10406#true} is VALID [2022-02-20 18:54:45,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {10406#true} assume ~id6~0 >= 0; {10406#true} is VALID [2022-02-20 18:54:45,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {10406#true} assume 0 == ~st6~0; {10406#true} is VALID [2022-02-20 18:54:45,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {10406#true} assume ~send6~0 == ~id6~0; {10406#true} is VALID [2022-02-20 18:54:45,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {10406#true} assume 0 == ~mode6~0 % 256; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,411 INFO L290 TraceCheckUtils]: 35: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13205~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13205~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~nomsg~0); {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:45,429 INFO L290 TraceCheckUtils]: 69: Hoare triple {10408#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {10407#false} is VALID [2022-02-20 18:54:45,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {10407#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {10407#false} is VALID [2022-02-20 18:54:45,430 INFO L290 TraceCheckUtils]: 71: Hoare triple {10407#false} ~mode6~0 := 0; {10407#false} is VALID [2022-02-20 18:54:45,430 INFO L290 TraceCheckUtils]: 72: Hoare triple {10407#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {10407#false} is VALID [2022-02-20 18:54:45,430 INFO L290 TraceCheckUtils]: 73: Hoare triple {10407#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {10407#false} is VALID [2022-02-20 18:54:45,430 INFO L290 TraceCheckUtils]: 74: Hoare triple {10407#false} ~__return_13338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13338~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; {10407#false} is VALID [2022-02-20 18:54:45,430 INFO L290 TraceCheckUtils]: 75: Hoare triple {10407#false} assume 0 == main_~assert__arg~0#1 % 256; {10407#false} is VALID [2022-02-20 18:54:45,431 INFO L290 TraceCheckUtils]: 76: Hoare triple {10407#false} assume !false; {10407#false} is VALID [2022-02-20 18:54:45,431 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:45,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:45,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548973390] [2022-02-20 18:54:45,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548973390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:45,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:45,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:45,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202711285] [2022-02-20 18:54:45,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:45,433 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:54:45,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:45,433 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:54:45,491 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:54:45,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:45,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:45,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:45,493 INFO L87 Difference]: Start difference. First operand 909 states and 1404 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:54:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:46,097 INFO L93 Difference]: Finished difference Result 2513 states and 3918 transitions. [2022-02-20 18:54:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:46,097 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:54:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:46,098 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:54:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:46,100 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:54:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-02-20 18:54:46,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 372 transitions. [2022-02-20 18:54:46,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:46,458 INFO L225 Difference]: With dead ends: 2513 [2022-02-20 18:54:46,459 INFO L226 Difference]: Without dead ends: 1647 [2022-02-20 18:54:46,460 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:54:46,460 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:46,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 332 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-02-20 18:54:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1645. [2022-02-20 18:54:46,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:46,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1647 states. Second operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call 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:46,547 INFO L74 IsIncluded]: Start isIncluded. First operand 1647 states. Second operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call 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:46,551 INFO L87 Difference]: Start difference. First operand 1647 states. Second operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call 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:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:46,650 INFO L93 Difference]: Finished difference Result 1647 states and 2541 transitions. [2022-02-20 18:54:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2541 transitions. [2022-02-20 18:54:46,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:46,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:46,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 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 1647 states. [2022-02-20 18:54:46,661 INFO L87 Difference]: Start difference. First operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 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 1647 states. [2022-02-20 18:54:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:46,780 INFO L93 Difference]: Finished difference Result 1647 states and 2541 transitions. [2022-02-20 18:54:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2541 transitions. [2022-02-20 18:54:46,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:46,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:46,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:46,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1644 states have (on average 1.5450121654501217) internal successors, (2540), 1644 states have internal predecessors, (2540), 0 states have call successors, (0), 0 states have call 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:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2540 transitions. [2022-02-20 18:54:46,963 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2540 transitions. Word has length 77 [2022-02-20 18:54:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:46,963 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2540 transitions. [2022-02-20 18:54:46,964 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:54:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2540 transitions. [2022-02-20 18:54:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:54:46,967 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:46,967 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:54:46,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:54:46,968 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:46,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1296361934, now seen corresponding path program 1 times [2022-02-20 18:54:46,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:46,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280923782] [2022-02-20 18:54:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:47,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {19527#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~__return_13205~0 := 0;~__return_13338~0 := 0; {19527#true} is VALID [2022-02-20 18:54:47,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {19527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~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;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_~init__tmp~0#1; {19527#true} is VALID [2022-02-20 18:54:47,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {19527#true} assume 0 == ~r1~0 % 256; {19527#true} is VALID [2022-02-20 18:54:47,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {19527#true} assume ~id1~0 >= 0; {19527#true} is VALID [2022-02-20 18:54:47,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {19527#true} assume 0 == ~st1~0; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:47,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {19529#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:47,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {19529#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:47,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {19529#(<= ~st1~0 0)} assume ~id2~0 >= 0; {19529#(<= ~st1~0 0)} is VALID [2022-02-20 18:54:47,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {19529#(<= ~st1~0 0)} assume 0 == ~st2~0; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {19530#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {19530#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {19531#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {19532#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:54:47,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {19533#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13205~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13205~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send4~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~nomsg~0); {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~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; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~p6_new~0 == ~nomsg~0;main_~node6____CPAchecker_TMP_0~0#1 := ~send6~0; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256);~mode6~0 := 1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,121 INFO L290 TraceCheckUtils]: 73: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:54:47,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {19534#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {19528#false} is VALID [2022-02-20 18:54:47,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {19528#false} ~__return_13338~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13338~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; {19528#false} is VALID [2022-02-20 18:54:47,122 INFO L290 TraceCheckUtils]: 76: Hoare triple {19528#false} assume 0 == main_~assert__arg~0#1 % 256; {19528#false} is VALID [2022-02-20 18:54:47,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {19528#false} assume !false; {19528#false} is VALID [2022-02-20 18:54:47,123 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:47,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:47,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280923782] [2022-02-20 18:54:47,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280923782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:47,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:47,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:54:47,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834971992] [2022-02-20 18:54:47,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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:54:47,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:47,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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:54:47,183 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:54:47,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:54:47,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:54:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:54:47,184 INFO L87 Difference]: Start difference. First operand 1645 states and 2540 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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:55:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:18,218 INFO L93 Difference]: Finished difference Result 20869 states and 32504 transitions. [2022-02-20 18:55:18,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:55:18,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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:55:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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:55:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-02-20 18:55:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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:55:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-02-20 18:55:18,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 1525 transitions. [2022-02-20 18:55:19,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1525 edges. 1525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:34,537 INFO L225 Difference]: With dead ends: 20869 [2022-02-20 18:55:34,537 INFO L226 Difference]: Without dead ends: 19267 [2022-02-20 18:55:34,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:55:34,545 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 1770 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:55:34,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1770 Valid, 2903 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:55:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19267 states. [2022-02-20 18:55:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19267 to 3245. [2022-02-20 18:55:38,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:38,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19267 states. Second operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:38,181 INFO L74 IsIncluded]: Start isIncluded. First operand 19267 states. Second operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:55:38,189 INFO L87 Difference]: Start difference. First operand 19267 states. Second operand has 3245 states, 3244 states have (on average 1.532675709001233) internal successors, (4972), 3244 states have internal predecessors, (4972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)