./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.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.ufo.BOUNDED-12.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 b1a54cb791c5af35332ec00d8dfd3a394281252d9141996dd7e5974a534492ee --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:54:50,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:54:50,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:54:50,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:54:50,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:54:50,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:54:50,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:54:50,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:54:50,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:54:50,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:54:50,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:54:50,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:54:50,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:54:50,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:54:50,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:54:50,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:54:50,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:54:50,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:54:50,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:54:50,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:54:50,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:54:50,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:54:50,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:54:50,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:54:50,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:54:50,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:54:50,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:54:50,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:54:50,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:54:50,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:54:50,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:54:50,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:54:50,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:54:50,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:54:50,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:54:50,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:54:50,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:54:50,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:54:50,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:54:50,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:54:50,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:54:50,696 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:50,713 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:54:50,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:54:50,714 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:54:50,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:54:50,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:54:50,715 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:54:50,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:54:50,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:54:50,716 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:54:50,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:54:50,716 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:54:50,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:54:50,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:54:50,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:54:50,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:54:50,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:54:50,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:54:50,717 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:54:50,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:54:50,718 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:54:50,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:54:50,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:54:50,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:54:50,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:54:50,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:54:50,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:54:50,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:54:50,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:54:50,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:54:50,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:54:50,720 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:54:50,720 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:54:50,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:54:50,720 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 -> b1a54cb791c5af35332ec00d8dfd3a394281252d9141996dd7e5974a534492ee [2022-02-20 18:54:50,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:54:50,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:54:50,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:54:50,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:54:50,994 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:54:50,995 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.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2022-02-20 18:54:51,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73735b46/78c8c1a69f004b04a55a3806dfb072fd/FLAG6536eb147 [2022-02-20 18:54:51,516 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:54:51,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2022-02-20 18:54:51,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73735b46/78c8c1a69f004b04a55a3806dfb072fd/FLAG6536eb147 [2022-02-20 18:54:51,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73735b46/78c8c1a69f004b04a55a3806dfb072fd [2022-02-20 18:54:51,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:54:51,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:54:51,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:54:51,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:54:51,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:54:51,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:54:51" (1/1) ... [2022-02-20 18:54:51,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e6c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:51, skipping insertion in model container [2022-02-20 18:54:51,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:54:51" (1/1) ... [2022-02-20 18:54:51,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:54:51,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:54:52,151 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.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6694,6707] [2022-02-20 18:54:52,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:54:52,193 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:54:52,236 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.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6694,6707] [2022-02-20 18:54:52,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:54:52,272 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:54:52,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:52 WrapperNode [2022-02-20 18:54:52,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:54:52,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:54:52,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:54:52,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:54:52,280 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:52" (1/1) ... [2022-02-20 18:54:52,289 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:52" (1/1) ... [2022-02-20 18:54:52,333 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 495 [2022-02-20 18:54:52,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:54:52,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:54:52,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:54:52,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:54:52,342 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:52" (1/1) ... [2022-02-20 18:54:52,342 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:52" (1/1) ... [2022-02-20 18:54:52,356 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:52" (1/1) ... [2022-02-20 18:54:52,365 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:52" (1/1) ... [2022-02-20 18:54:52,373 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:52" (1/1) ... [2022-02-20 18:54:52,378 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:52" (1/1) ... [2022-02-20 18:54:52,381 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:52" (1/1) ... [2022-02-20 18:54:52,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:54:52,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:54:52,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:54:52,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:54:52,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:52" (1/1) ... [2022-02-20 18:54:52,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:54:52,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:54:52,438 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:52,440 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:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:54:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:54:52,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:54:52,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:54:52,613 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:54:52,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:54:53,126 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:54:53,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:54:53,133 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:54:53,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:54:53 BoogieIcfgContainer [2022-02-20 18:54:53,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:54:53,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:54:53,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:54:53,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:54:53,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:54:51" (1/3) ... [2022-02-20 18:54:53,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bacf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:54:53, skipping insertion in model container [2022-02-20 18:54:53,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:54:52" (2/3) ... [2022-02-20 18:54:53,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bacf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:54:53, skipping insertion in model container [2022-02-20 18:54:53,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:54:53" (3/3) ... [2022-02-20 18:54:53,143 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2022-02-20 18:54:53,147 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:54:53,147 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:54:53,191 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:54:53,196 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:53,196 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:54:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 115 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call 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:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:54:53,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:53,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:53,227 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -866113193, now seen corresponding path program 1 times [2022-02-20 18:54:53,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:53,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312453230] [2022-02-20 18:54:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:53,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#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(49, 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_13301~0 := 0;~__return_13434~0 := 0;~__return_13526~0 := 0; {119#true} is VALID [2022-02-20 18:54:53,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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; {119#true} is VALID [2022-02-20 18:54:53,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#true} assume 0 == ~r1~0; {119#true} is VALID [2022-02-20 18:54:53,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {119#true} assume ~id1~0 >= 0; {119#true} is VALID [2022-02-20 18:54:53,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#true} assume 0 == ~st1~0; {119#true} is VALID [2022-02-20 18:54:53,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#true} assume ~send1~0 == ~id1~0; {119#true} is VALID [2022-02-20 18:54:53,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {119#true} assume 0 == ~mode1~0 % 256; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,683 INFO L290 TraceCheckUtils]: 37: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13301~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13301~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:53,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {121#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {120#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {120#false} is VALID [2022-02-20 18:54:53,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {120#false} ~mode1~0 := 0; {120#false} is VALID [2022-02-20 18:54:53,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {120#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {120#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {120#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {120#false} is VALID [2022-02-20 18:54:53,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {120#false} ~mode2~0 := 0; {120#false} is VALID [2022-02-20 18:54:53,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {120#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {120#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {120#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {120#false} is VALID [2022-02-20 18:54:53,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {120#false} ~mode3~0 := 0; {120#false} is VALID [2022-02-20 18:54:53,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {120#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {120#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,697 INFO L290 TraceCheckUtils]: 57: Hoare triple {120#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {120#false} is VALID [2022-02-20 18:54:53,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {120#false} ~mode4~0 := 0; {120#false} is VALID [2022-02-20 18:54:53,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {120#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {120#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {120#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {120#false} is VALID [2022-02-20 18:54:53,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {120#false} ~mode5~0 := 0; {120#false} is VALID [2022-02-20 18:54:53,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {120#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {120#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {120#false} is VALID [2022-02-20 18:54:53,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {120#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {120#false} is VALID [2022-02-20 18:54:53,701 INFO L290 TraceCheckUtils]: 66: Hoare triple {120#false} ~mode6~0 := 0; {120#false} is VALID [2022-02-20 18:54:53,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {120#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; {120#false} is VALID [2022-02-20 18:54:53,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {120#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {120#false} is VALID [2022-02-20 18:54:53,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {120#false} ~__return_13434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13434~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; {120#false} is VALID [2022-02-20 18:54:53,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {120#false} assume 0 == main_~assert__arg~0#1 % 256; {120#false} is VALID [2022-02-20 18:54:53,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-02-20 18:54:53,707 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:53,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:53,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312453230] [2022-02-20 18:54:53,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312453230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:53,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:53,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:53,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912537056] [2022-02-20 18:54:53,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:53,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:54:53,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:53,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:53,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:53,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:53,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:53,835 INFO L87 Difference]: Start difference. First operand has 116 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 115 states have internal predecessors, (199), 0 states have call successors, (0), 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.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:54,235 INFO L93 Difference]: Finished difference Result 254 states and 416 transitions. [2022-02-20 18:54:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:54,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-02-20 18:54:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:54:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 18:54:54,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 18:54:54,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:54,642 INFO L225 Difference]: With dead ends: 254 [2022-02-20 18:54:54,642 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 18:54:54,651 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:54,657 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 140 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 407 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:54,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 407 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:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 18:54:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2022-02-20 18:54:54,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:54,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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:54,732 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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:54,735 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:54,750 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-02-20 18:54:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-02-20 18:54:54,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:54,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:54,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 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 175 states. [2022-02-20 18:54:54,758 INFO L87 Difference]: Start difference. First operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 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 175 states. [2022-02-20 18:54:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:54,768 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-02-20 18:54:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-02-20 18:54:54,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:54,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:54,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:54,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 172 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2022-02-20 18:54:54,779 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 72 [2022-02-20 18:54:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:54,780 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2022-02-20 18:54:54,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call 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:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2022-02-20 18:54:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:54:54,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:54,785 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:54,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:54:54,785 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash -566031041, now seen corresponding path program 1 times [2022-02-20 18:54:54,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:54,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825844325] [2022-02-20 18:54:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:54,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:54,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {1033#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(49, 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_13301~0 := 0;~__return_13434~0 := 0;~__return_13526~0 := 0; {1033#true} is VALID [2022-02-20 18:54:54,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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; {1033#true} is VALID [2022-02-20 18:54:54,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume 0 == ~r1~0; {1033#true} is VALID [2022-02-20 18:54:54,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {1033#true} assume ~id1~0 >= 0; {1033#true} is VALID [2022-02-20 18:54:54,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {1033#true} assume 0 == ~st1~0; {1033#true} is VALID [2022-02-20 18:54:54,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} assume ~send1~0 == ~id1~0; {1033#true} is VALID [2022-02-20 18:54:54,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#true} assume 0 == ~mode1~0 % 256; {1033#true} is VALID [2022-02-20 18:54:54,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#true} assume ~id2~0 >= 0; {1033#true} is VALID [2022-02-20 18:54:54,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {1033#true} assume 0 == ~st2~0; {1033#true} is VALID [2022-02-20 18:54:54,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#true} assume ~send2~0 == ~id2~0; {1033#true} is VALID [2022-02-20 18:54:54,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {1033#true} assume 0 == ~mode2~0 % 256; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13301~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13301~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {1035#(= (+ (* (- 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; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {1035#(= (+ (* (- 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; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1035#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:54:54,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {1035#(= (+ (* (- 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; {1034#false} is VALID [2022-02-20 18:54:54,909 INFO L290 TraceCheckUtils]: 50: Hoare triple {1034#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {1034#false} is VALID [2022-02-20 18:54:54,909 INFO L290 TraceCheckUtils]: 51: Hoare triple {1034#false} ~mode2~0 := 0; {1034#false} is VALID [2022-02-20 18:54:54,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {1034#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {1034#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {1034#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1034#false} is VALID [2022-02-20 18:54:54,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {1034#false} ~mode3~0 := 0; {1034#false} is VALID [2022-02-20 18:54:54,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {1034#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {1034#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {1034#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1034#false} is VALID [2022-02-20 18:54:54,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {1034#false} ~mode4~0 := 0; {1034#false} is VALID [2022-02-20 18:54:54,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {1034#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {1034#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {1034#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1034#false} is VALID [2022-02-20 18:54:54,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {1034#false} ~mode5~0 := 0; {1034#false} is VALID [2022-02-20 18:54:54,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {1034#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {1034#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1034#false} is VALID [2022-02-20 18:54:54,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {1034#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1034#false} is VALID [2022-02-20 18:54:54,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {1034#false} ~mode6~0 := 0; {1034#false} is VALID [2022-02-20 18:54:54,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {1034#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; {1034#false} is VALID [2022-02-20 18:54:54,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {1034#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {1034#false} is VALID [2022-02-20 18:54:54,913 INFO L290 TraceCheckUtils]: 70: Hoare triple {1034#false} ~__return_13434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13434~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; {1034#false} is VALID [2022-02-20 18:54:54,913 INFO L290 TraceCheckUtils]: 71: Hoare triple {1034#false} assume 0 == main_~assert__arg~0#1 % 256; {1034#false} is VALID [2022-02-20 18:54:54,914 INFO L290 TraceCheckUtils]: 72: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-02-20 18:54:54,914 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:54,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:54,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825844325] [2022-02-20 18:54:54,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825844325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:54,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:54,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:54,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897033540] [2022-02-20 18:54:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:54,917 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:54,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:54,917 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:54,978 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:54,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:54,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:54,980 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. 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:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:55,235 INFO L93 Difference]: Finished difference Result 417 states and 638 transitions. [2022-02-20 18:54:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:55,235 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:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:55,237 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:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:55,241 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:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:55,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 18:54:55,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:55,526 INFO L225 Difference]: With dead ends: 417 [2022-02-20 18:54:55,527 INFO L226 Difference]: Without dead ends: 287 [2022-02-20 18:54:55,528 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:55,529 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 96 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 350 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:55,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 350 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:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-02-20 18:54:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-02-20 18:54:55,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:55,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 284 states have (on average 1.5070422535211268) internal successors, (428), 284 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:55,549 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 284 states have (on average 1.5070422535211268) internal successors, (428), 284 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:55,550 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 284 states have (on average 1.5070422535211268) internal successors, (428), 284 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:55,559 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2022-02-20 18:54:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 429 transitions. [2022-02-20 18:54:55,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:55,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:55,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 284 states have (on average 1.5070422535211268) internal successors, (428), 284 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 287 states. [2022-02-20 18:54:55,562 INFO L87 Difference]: Start difference. First operand has 285 states, 284 states have (on average 1.5070422535211268) internal successors, (428), 284 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 287 states. [2022-02-20 18:54:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:55,571 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2022-02-20 18:54:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 429 transitions. [2022-02-20 18:54:55,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:55,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:55,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:55,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.5070422535211268) internal successors, (428), 284 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2022-02-20 18:54:55,584 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 73 [2022-02-20 18:54:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:55,584 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2022-02-20 18:54:55,585 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:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2022-02-20 18:54:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:54:55,585 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:55,586 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:55,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:54:55,586 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash -739923133, now seen corresponding path program 1 times [2022-02-20 18:54:55,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:55,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169167574] [2022-02-20 18:54:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:55,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {2557#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(49, 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_13301~0 := 0;~__return_13434~0 := 0;~__return_13526~0 := 0; {2557#true} is VALID [2022-02-20 18:54:55,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {2557#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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; {2557#true} is VALID [2022-02-20 18:54:55,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#true} assume 0 == ~r1~0; {2557#true} is VALID [2022-02-20 18:54:55,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {2557#true} assume ~id1~0 >= 0; {2557#true} is VALID [2022-02-20 18:54:55,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {2557#true} assume 0 == ~st1~0; {2557#true} is VALID [2022-02-20 18:54:55,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#true} assume ~send1~0 == ~id1~0; {2557#true} is VALID [2022-02-20 18:54:55,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {2557#true} assume 0 == ~mode1~0 % 256; {2557#true} is VALID [2022-02-20 18:54:55,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#true} assume ~id2~0 >= 0; {2557#true} is VALID [2022-02-20 18:54:55,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#true} assume 0 == ~st2~0; {2557#true} is VALID [2022-02-20 18:54:55,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#true} assume ~send2~0 == ~id2~0; {2557#true} is VALID [2022-02-20 18:54:55,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {2557#true} assume 0 == ~mode2~0 % 256; {2557#true} is VALID [2022-02-20 18:54:55,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {2557#true} assume ~id3~0 >= 0; {2557#true} is VALID [2022-02-20 18:54:55,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#true} assume 0 == ~st3~0; {2557#true} is VALID [2022-02-20 18:54:55,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#true} assume ~send3~0 == ~id3~0; {2557#true} is VALID [2022-02-20 18:54:55,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#true} assume 0 == ~mode3~0 % 256; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13301~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13301~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {2559#(= (+ (* (- 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; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {2559#(= (+ (* (- 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; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {2559#(= (+ (* (- 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; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2559#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:54:55,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {2559#(= (+ (* (- 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; {2558#false} is VALID [2022-02-20 18:54:55,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {2558#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {2558#false} is VALID [2022-02-20 18:54:55,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {2558#false} ~mode3~0 := 0; {2558#false} is VALID [2022-02-20 18:54:55,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {2558#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2558#false} is VALID [2022-02-20 18:54:55,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {2558#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2558#false} is VALID [2022-02-20 18:54:55,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {2558#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2558#false} is VALID [2022-02-20 18:54:55,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {2558#false} ~mode4~0 := 0; {2558#false} is VALID [2022-02-20 18:54:55,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {2558#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {2558#false} is VALID [2022-02-20 18:54:55,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {2558#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2558#false} is VALID [2022-02-20 18:54:55,771 INFO L290 TraceCheckUtils]: 63: Hoare triple {2558#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {2558#false} is VALID [2022-02-20 18:54:55,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {2558#false} ~mode5~0 := 0; {2558#false} is VALID [2022-02-20 18:54:55,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {2558#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {2558#false} is VALID [2022-02-20 18:54:55,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {2558#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2558#false} is VALID [2022-02-20 18:54:55,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {2558#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {2558#false} is VALID [2022-02-20 18:54:55,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {2558#false} ~mode6~0 := 0; {2558#false} is VALID [2022-02-20 18:54:55,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {2558#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; {2558#false} is VALID [2022-02-20 18:54:55,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {2558#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {2558#false} is VALID [2022-02-20 18:54:55,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {2558#false} ~__return_13434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13434~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; {2558#false} is VALID [2022-02-20 18:54:55,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {2558#false} assume 0 == main_~assert__arg~0#1 % 256; {2558#false} is VALID [2022-02-20 18:54:55,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {2558#false} assume !false; {2558#false} is VALID [2022-02-20 18:54:55,773 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:55,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:55,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169167574] [2022-02-20 18:54:55,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169167574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:55,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:55,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:55,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590206714] [2022-02-20 18:54:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:55,775 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:55,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:55,776 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:55,838 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:55,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:55,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:55,840 INFO L87 Difference]: Start difference. First operand 285 states and 428 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:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:56,114 INFO L93 Difference]: Finished difference Result 737 states and 1146 transitions. [2022-02-20 18:54:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:56,114 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:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:56,118 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:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:56,121 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:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:56,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 18:54:56,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:56,419 INFO L225 Difference]: With dead ends: 737 [2022-02-20 18:54:56,420 INFO L226 Difference]: Without dead ends: 495 [2022-02-20 18:54:56,421 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:56,422 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 91 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 346 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:56,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 346 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:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-02-20 18:54:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2022-02-20 18:54:56,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:56,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 493 states, 492 states have (on average 1.5365853658536586) internal successors, (756), 492 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call 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:56,456 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 493 states, 492 states have (on average 1.5365853658536586) internal successors, (756), 492 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call 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:56,457 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 493 states, 492 states have (on average 1.5365853658536586) internal successors, (756), 492 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call 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:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:56,479 INFO L93 Difference]: Finished difference Result 495 states and 757 transitions. [2022-02-20 18:54:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 757 transitions. [2022-02-20 18:54:56,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:56,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:56,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 492 states have (on average 1.5365853658536586) internal successors, (756), 492 states have internal predecessors, (756), 0 states have call successors, (0), 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 495 states. [2022-02-20 18:54:56,483 INFO L87 Difference]: Start difference. First operand has 493 states, 492 states have (on average 1.5365853658536586) internal successors, (756), 492 states have internal predecessors, (756), 0 states have call successors, (0), 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 495 states. [2022-02-20 18:54:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:56,505 INFO L93 Difference]: Finished difference Result 495 states and 757 transitions. [2022-02-20 18:54:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 757 transitions. [2022-02-20 18:54:56,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:56,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:56,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:56,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.5365853658536586) internal successors, (756), 492 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call 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:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 756 transitions. [2022-02-20 18:54:56,530 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 756 transitions. Word has length 74 [2022-02-20 18:54:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:56,530 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 756 transitions. [2022-02-20 18:54:56,530 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:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 756 transitions. [2022-02-20 18:54:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:54:56,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:56,531 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:56,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:54:56,532 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash 330068461, now seen corresponding path program 1 times [2022-02-20 18:54:56,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:56,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486406865] [2022-02-20 18:54:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:56,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {5238#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(49, 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_13301~0 := 0;~__return_13434~0 := 0;~__return_13526~0 := 0; {5238#true} is VALID [2022-02-20 18:54:56,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {5238#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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; {5238#true} is VALID [2022-02-20 18:54:56,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {5238#true} assume 0 == ~r1~0; {5238#true} is VALID [2022-02-20 18:54:56,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {5238#true} assume ~id1~0 >= 0; {5238#true} is VALID [2022-02-20 18:54:56,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {5238#true} assume 0 == ~st1~0; {5238#true} is VALID [2022-02-20 18:54:56,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {5238#true} assume ~send1~0 == ~id1~0; {5238#true} is VALID [2022-02-20 18:54:56,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {5238#true} assume 0 == ~mode1~0 % 256; {5238#true} is VALID [2022-02-20 18:54:56,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {5238#true} assume ~id2~0 >= 0; {5238#true} is VALID [2022-02-20 18:54:56,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {5238#true} assume 0 == ~st2~0; {5238#true} is VALID [2022-02-20 18:54:56,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {5238#true} assume ~send2~0 == ~id2~0; {5238#true} is VALID [2022-02-20 18:54:56,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {5238#true} assume 0 == ~mode2~0 % 256; {5238#true} is VALID [2022-02-20 18:54:56,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {5238#true} assume ~id3~0 >= 0; {5238#true} is VALID [2022-02-20 18:54:56,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {5238#true} assume 0 == ~st3~0; {5238#true} is VALID [2022-02-20 18:54:56,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {5238#true} assume ~send3~0 == ~id3~0; {5238#true} is VALID [2022-02-20 18:54:56,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {5238#true} assume 0 == ~mode3~0 % 256; {5238#true} is VALID [2022-02-20 18:54:56,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {5238#true} assume ~id4~0 >= 0; {5238#true} is VALID [2022-02-20 18:54:56,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {5238#true} assume 0 == ~st4~0; {5238#true} is VALID [2022-02-20 18:54:56,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {5238#true} assume ~send4~0 == ~id4~0; {5238#true} is VALID [2022-02-20 18:54:56,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {5238#true} assume 0 == ~mode4~0 % 256; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13301~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13301~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {5240#(= (+ (* (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; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0); {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,681 INFO L290 TraceCheckUtils]: 46: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {5240#(= (+ (* (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; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {5240#(= (+ (* (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; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,685 INFO L290 TraceCheckUtils]: 55: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {5240#(= (+ (* (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; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {5240#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:54:56,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {5240#(= (+ (* (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; {5239#false} is VALID [2022-02-20 18:54:56,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {5239#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {5239#false} is VALID [2022-02-20 18:54:56,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {5239#false} ~mode4~0 := 0; {5239#false} is VALID [2022-02-20 18:54:56,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {5239#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {5239#false} is VALID [2022-02-20 18:54:56,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {5239#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5239#false} is VALID [2022-02-20 18:54:56,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {5239#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {5239#false} is VALID [2022-02-20 18:54:56,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {5239#false} ~mode5~0 := 0; {5239#false} is VALID [2022-02-20 18:54:56,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {5239#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {5239#false} is VALID [2022-02-20 18:54:56,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {5239#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5239#false} is VALID [2022-02-20 18:54:56,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {5239#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {5239#false} is VALID [2022-02-20 18:54:56,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {5239#false} ~mode6~0 := 0; {5239#false} is VALID [2022-02-20 18:54:56,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {5239#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; {5239#false} is VALID [2022-02-20 18:54:56,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {5239#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {5239#false} is VALID [2022-02-20 18:54:56,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {5239#false} ~__return_13434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13434~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; {5239#false} is VALID [2022-02-20 18:54:56,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {5239#false} assume 0 == main_~assert__arg~0#1 % 256; {5239#false} is VALID [2022-02-20 18:54:56,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {5239#false} assume !false; {5239#false} is VALID [2022-02-20 18:54:56,689 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:56,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:56,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486406865] [2022-02-20 18:54:56,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486406865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:56,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:56,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:56,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926931814] [2022-02-20 18:54:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:56,691 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:56,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:56,692 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:56,746 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:56,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:56,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:56,747 INFO L87 Difference]: Start difference. First operand 493 states and 756 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:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:57,116 INFO L93 Difference]: Finished difference Result 1329 states and 2078 transitions. [2022-02-20 18:54:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:57,117 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:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:57,117 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:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:57,120 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:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:57,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 18:54:57,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:57,435 INFO L225 Difference]: With dead ends: 1329 [2022-02-20 18:54:57,436 INFO L226 Difference]: Without dead ends: 879 [2022-02-20 18:54:57,436 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:57,438 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 86 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 342 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:57,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 342 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:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2022-02-20 18:54:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2022-02-20 18:54:57,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:57,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 879 states. Second operand has 877 states, 876 states have (on average 1.547945205479452) internal successors, (1356), 876 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call 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:57,488 INFO L74 IsIncluded]: Start isIncluded. First operand 879 states. Second operand has 877 states, 876 states have (on average 1.547945205479452) internal successors, (1356), 876 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call 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:57,490 INFO L87 Difference]: Start difference. First operand 879 states. Second operand has 877 states, 876 states have (on average 1.547945205479452) internal successors, (1356), 876 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call 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:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:57,534 INFO L93 Difference]: Finished difference Result 879 states and 1357 transitions. [2022-02-20 18:54:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1357 transitions. [2022-02-20 18:54:57,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:57,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:57,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 877 states, 876 states have (on average 1.547945205479452) internal successors, (1356), 876 states have internal predecessors, (1356), 0 states have call successors, (0), 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 879 states. [2022-02-20 18:54:57,540 INFO L87 Difference]: Start difference. First operand has 877 states, 876 states have (on average 1.547945205479452) internal successors, (1356), 876 states have internal predecessors, (1356), 0 states have call successors, (0), 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 879 states. [2022-02-20 18:54:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:57,584 INFO L93 Difference]: Finished difference Result 879 states and 1357 transitions. [2022-02-20 18:54:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1357 transitions. [2022-02-20 18:54:57,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:57,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:57,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:57,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 1.547945205479452) internal successors, (1356), 876 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call 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:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1356 transitions. [2022-02-20 18:54:57,644 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1356 transitions. Word has length 75 [2022-02-20 18:54:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:57,644 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1356 transitions. [2022-02-20 18:54:57,644 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:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1356 transitions. [2022-02-20 18:54:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:54:57,645 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:57,645 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:57,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:54:57,646 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -298149753, now seen corresponding path program 1 times [2022-02-20 18:54:57,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:57,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525537012] [2022-02-20 18:54:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:57,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {10059#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(49, 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_13301~0 := 0;~__return_13434~0 := 0;~__return_13526~0 := 0; {10059#true} is VALID [2022-02-20 18:54:57,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {10059#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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; {10059#true} is VALID [2022-02-20 18:54:57,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {10059#true} assume 0 == ~r1~0; {10059#true} is VALID [2022-02-20 18:54:57,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {10059#true} assume ~id1~0 >= 0; {10059#true} is VALID [2022-02-20 18:54:57,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {10059#true} assume 0 == ~st1~0; {10059#true} is VALID [2022-02-20 18:54:57,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {10059#true} assume ~send1~0 == ~id1~0; {10059#true} is VALID [2022-02-20 18:54:57,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {10059#true} assume 0 == ~mode1~0 % 256; {10059#true} is VALID [2022-02-20 18:54:57,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {10059#true} assume ~id2~0 >= 0; {10059#true} is VALID [2022-02-20 18:54:57,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {10059#true} assume 0 == ~st2~0; {10059#true} is VALID [2022-02-20 18:54:57,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {10059#true} assume ~send2~0 == ~id2~0; {10059#true} is VALID [2022-02-20 18:54:57,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {10059#true} assume 0 == ~mode2~0 % 256; {10059#true} is VALID [2022-02-20 18:54:57,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {10059#true} assume ~id3~0 >= 0; {10059#true} is VALID [2022-02-20 18:54:57,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {10059#true} assume 0 == ~st3~0; {10059#true} is VALID [2022-02-20 18:54:57,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {10059#true} assume ~send3~0 == ~id3~0; {10059#true} is VALID [2022-02-20 18:54:57,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {10059#true} assume 0 == ~mode3~0 % 256; {10059#true} is VALID [2022-02-20 18:54:57,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {10059#true} assume ~id4~0 >= 0; {10059#true} is VALID [2022-02-20 18:54:57,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {10059#true} assume 0 == ~st4~0; {10059#true} is VALID [2022-02-20 18:54:57,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {10059#true} assume ~send4~0 == ~id4~0; {10059#true} is VALID [2022-02-20 18:54:57,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {10059#true} assume 0 == ~mode4~0 % 256; {10059#true} is VALID [2022-02-20 18:54:57,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {10059#true} assume ~id5~0 >= 0; {10059#true} is VALID [2022-02-20 18:54:57,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {10059#true} assume 0 == ~st5~0; {10059#true} is VALID [2022-02-20 18:54:57,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {10059#true} assume ~send5~0 == ~id5~0; {10059#true} is VALID [2022-02-20 18:54:57,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {10059#true} assume 0 == ~mode5~0 % 256; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13301~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13301~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {10061#(= (+ (* (- 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; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0); {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {10061#(= (+ (* (- 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; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {10061#(= (+ (* (- 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; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {10061#(= (+ (* (- 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; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,739 INFO L290 TraceCheckUtils]: 59: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,739 INFO L290 TraceCheckUtils]: 60: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,739 INFO L290 TraceCheckUtils]: 61: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,740 INFO L290 TraceCheckUtils]: 62: Hoare triple {10061#(= (+ (* (- 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; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,740 INFO L290 TraceCheckUtils]: 63: Hoare triple {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {10061#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 64: Hoare triple {10061#(= (+ (* (- 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; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 65: Hoare triple {10060#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 66: Hoare triple {10060#false} ~mode5~0 := 0; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 67: Hoare triple {10060#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {10060#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {10060#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {10060#false} ~mode6~0 := 0; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {10060#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; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {10060#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {10060#false} ~__return_13434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13434~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; {10060#false} is VALID [2022-02-20 18:54:57,741 INFO L290 TraceCheckUtils]: 74: Hoare triple {10060#false} assume 0 == main_~assert__arg~0#1 % 256; {10060#false} is VALID [2022-02-20 18:54:57,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {10060#false} assume !false; {10060#false} is VALID [2022-02-20 18:54:57,742 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:57,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:57,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525537012] [2022-02-20 18:54:57,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525537012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:57,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:57,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:57,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255901297] [2022-02-20 18:54:57,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:57,744 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:57,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:57,744 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:57,793 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:57,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:57,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:57,794 INFO L87 Difference]: Start difference. First operand 877 states and 1356 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:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:58,425 INFO L93 Difference]: Finished difference Result 2417 states and 3774 transitions. [2022-02-20 18:54:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:58,425 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:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:58,426 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:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:58,428 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:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:54:58,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 18:54:58,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:58,800 INFO L225 Difference]: With dead ends: 2417 [2022-02-20 18:54:58,800 INFO L226 Difference]: Without dead ends: 1583 [2022-02-20 18:54:58,801 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:58,801 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 81 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 338 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:58,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 338 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:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-02-20 18:54:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1581. [2022-02-20 18:54:58,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:58,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1583 states. Second operand has 1581 states, 1580 states have (on average 1.5468354430379747) internal successors, (2444), 1580 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call 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:58,887 INFO L74 IsIncluded]: Start isIncluded. First operand 1583 states. Second operand has 1581 states, 1580 states have (on average 1.5468354430379747) internal successors, (2444), 1580 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call 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:58,889 INFO L87 Difference]: Start difference. First operand 1583 states. Second operand has 1581 states, 1580 states have (on average 1.5468354430379747) internal successors, (2444), 1580 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call 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:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:59,015 INFO L93 Difference]: Finished difference Result 1583 states and 2445 transitions. [2022-02-20 18:54:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2445 transitions. [2022-02-20 18:54:59,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:59,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:59,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 1581 states, 1580 states have (on average 1.5468354430379747) internal successors, (2444), 1580 states have internal predecessors, (2444), 0 states have call successors, (0), 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 1583 states. [2022-02-20 18:54:59,024 INFO L87 Difference]: Start difference. First operand has 1581 states, 1580 states have (on average 1.5468354430379747) internal successors, (2444), 1580 states have internal predecessors, (2444), 0 states have call successors, (0), 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 1583 states. [2022-02-20 18:54:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:59,153 INFO L93 Difference]: Finished difference Result 1583 states and 2445 transitions. [2022-02-20 18:54:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2445 transitions. [2022-02-20 18:54:59,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:59,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:59,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:59,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 1.5468354430379747) internal successors, (2444), 1580 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call 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:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2444 transitions. [2022-02-20 18:54:59,313 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2444 transitions. Word has length 76 [2022-02-20 18:54:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:59,313 INFO L470 AbstractCegarLoop]: Abstraction has 1581 states and 2444 transitions. [2022-02-20 18:54:59,313 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:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2444 transitions. [2022-02-20 18:54:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 18:54:59,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:59,314 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:59,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:54:59,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2012894605, now seen corresponding path program 1 times [2022-02-20 18:54:59,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:59,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002800808] [2022-02-20 18:54:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:59,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {18812#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(49, 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_13301~0 := 0;~__return_13434~0 := 0;~__return_13526~0 := 0; {18812#true} is VALID [2022-02-20 18:54:59,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {18812#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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; {18812#true} is VALID [2022-02-20 18:54:59,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {18812#true} assume 0 == ~r1~0; {18812#true} is VALID [2022-02-20 18:54:59,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {18812#true} assume ~id1~0 >= 0; {18812#true} is VALID [2022-02-20 18:54:59,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {18812#true} assume 0 == ~st1~0; {18812#true} is VALID [2022-02-20 18:54:59,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {18812#true} assume ~send1~0 == ~id1~0; {18812#true} is VALID [2022-02-20 18:54:59,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {18812#true} assume 0 == ~mode1~0 % 256; {18812#true} is VALID [2022-02-20 18:54:59,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {18812#true} assume ~id2~0 >= 0; {18812#true} is VALID [2022-02-20 18:54:59,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {18812#true} assume 0 == ~st2~0; {18812#true} is VALID [2022-02-20 18:54:59,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {18812#true} assume ~send2~0 == ~id2~0; {18812#true} is VALID [2022-02-20 18:54:59,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {18812#true} assume 0 == ~mode2~0 % 256; {18812#true} is VALID [2022-02-20 18:54:59,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {18812#true} assume ~id3~0 >= 0; {18812#true} is VALID [2022-02-20 18:54:59,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {18812#true} assume 0 == ~st3~0; {18812#true} is VALID [2022-02-20 18:54:59,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {18812#true} assume ~send3~0 == ~id3~0; {18812#true} is VALID [2022-02-20 18:54:59,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {18812#true} assume 0 == ~mode3~0 % 256; {18812#true} is VALID [2022-02-20 18:54:59,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {18812#true} assume ~id4~0 >= 0; {18812#true} is VALID [2022-02-20 18:54:59,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {18812#true} assume 0 == ~st4~0; {18812#true} is VALID [2022-02-20 18:54:59,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {18812#true} assume ~send4~0 == ~id4~0; {18812#true} is VALID [2022-02-20 18:54:59,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {18812#true} assume 0 == ~mode4~0 % 256; {18812#true} is VALID [2022-02-20 18:54:59,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {18812#true} assume ~id5~0 >= 0; {18812#true} is VALID [2022-02-20 18:54:59,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {18812#true} assume 0 == ~st5~0; {18812#true} is VALID [2022-02-20 18:54:59,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {18812#true} assume ~send5~0 == ~id5~0; {18812#true} is VALID [2022-02-20 18:54:59,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {18812#true} assume 0 == ~mode5~0 % 256; {18812#true} is VALID [2022-02-20 18:54:59,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {18812#true} assume ~id6~0 >= 0; {18812#true} is VALID [2022-02-20 18:54:59,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {18812#true} assume 0 == ~st6~0; {18812#true} is VALID [2022-02-20 18:54:59,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {18812#true} assume ~send6~0 == ~id6~0; {18812#true} is VALID [2022-02-20 18:54:59,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {18812#true} assume 0 == ~mode6~0 % 256; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;main_~init__tmp~0#1 := 1;~__return_13301~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13301~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {18814#(= (+ (* (- 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; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~nomsg~0); {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {18814#(= (+ (* (- 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; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {18814#(= (+ (* (- 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; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0); {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {18814#(= (+ (* (- 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; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,392 INFO L290 TraceCheckUtils]: 60: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {18814#(= (+ (* (- 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; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,395 INFO L290 TraceCheckUtils]: 65: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send5~0 != ~nomsg~0); {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,396 INFO L290 TraceCheckUtils]: 67: Hoare triple {18814#(= (+ (* (- 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; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {18814#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:54:59,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {18814#(= (+ (* (- 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; {18813#false} is VALID [2022-02-20 18:54:59,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {18813#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {18813#false} is VALID [2022-02-20 18:54:59,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {18813#false} ~mode6~0 := 0; {18813#false} is VALID [2022-02-20 18:54:59,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {18813#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; {18813#false} is VALID [2022-02-20 18:54:59,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {18813#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);main_~check__tmp~0#1 := 0; {18813#false} is VALID [2022-02-20 18:54:59,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {18813#false} ~__return_13434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13434~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; {18813#false} is VALID [2022-02-20 18:54:59,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {18813#false} assume 0 == main_~assert__arg~0#1 % 256; {18813#false} is VALID [2022-02-20 18:54:59,398 INFO L290 TraceCheckUtils]: 76: Hoare triple {18813#false} assume !false; {18813#false} is VALID [2022-02-20 18:54:59,399 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:59,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:59,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002800808] [2022-02-20 18:54:59,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002800808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:59,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:59,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:59,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252210713] [2022-02-20 18:54:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:59,400 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:59,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:59,401 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:59,465 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:59,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:59,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:59,466 INFO L87 Difference]: Start difference. First operand 1581 states and 2444 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:55:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:00,751 INFO L93 Difference]: Finished difference Result 4401 states and 6830 transitions. [2022-02-20 18:55:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:55:00,751 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:55:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:55:00,752 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:55:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:55:00,755 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:55:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:55:00,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 18:55:01,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:55:01,327 INFO L225 Difference]: With dead ends: 4401 [2022-02-20 18:55:01,327 INFO L226 Difference]: Without dead ends: 2863 [2022-02-20 18:55:01,329 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:55:01,330 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 76 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 334 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:55:01,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 334 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:55:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-02-20 18:55:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2861. [2022-02-20 18:55:01,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:55:01,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2863 states. Second operand has 2861 states, 2860 states have (on average 1.5370629370629372) internal successors, (4396), 2860 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call 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:01,507 INFO L74 IsIncluded]: Start isIncluded. First operand 2863 states. Second operand has 2861 states, 2860 states have (on average 1.5370629370629372) internal successors, (4396), 2860 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call 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:01,512 INFO L87 Difference]: Start difference. First operand 2863 states. Second operand has 2861 states, 2860 states have (on average 1.5370629370629372) internal successors, (4396), 2860 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call 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:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:01,835 INFO L93 Difference]: Finished difference Result 2863 states and 4397 transitions. [2022-02-20 18:55:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4397 transitions. [2022-02-20 18:55:01,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:01,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:01,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 2861 states, 2860 states have (on average 1.5370629370629372) internal successors, (4396), 2860 states have internal predecessors, (4396), 0 states have call successors, (0), 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 2863 states. [2022-02-20 18:55:01,852 INFO L87 Difference]: Start difference. First operand has 2861 states, 2860 states have (on average 1.5370629370629372) internal successors, (4396), 2860 states have internal predecessors, (4396), 0 states have call successors, (0), 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 2863 states. [2022-02-20 18:55:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:55:02,110 INFO L93 Difference]: Finished difference Result 2863 states and 4397 transitions. [2022-02-20 18:55:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 4397 transitions. [2022-02-20 18:55:02,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:55:02,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:55:02,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:55:02,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:55:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.5370629370629372) internal successors, (4396), 2860 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call 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:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4396 transitions. [2022-02-20 18:55:02,477 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4396 transitions. Word has length 77 [2022-02-20 18:55:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:55:02,477 INFO L470 AbstractCegarLoop]: Abstraction has 2861 states and 4396 transitions. [2022-02-20 18:55:02,477 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:55:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4396 transitions. [2022-02-20 18:55:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:55:02,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:55:02,478 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:55:02,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:55:02,479 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:55:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:55:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1910583587, now seen corresponding path program 1 times [2022-02-20 18:55:02,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:55:02,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608310289] [2022-02-20 18:55:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:55:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:55:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:55:02,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {34733#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(49, 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_13301~0 := 0;~__return_13434~0 := 0;~__return_13526~0 := 0; {34733#true} is VALID [2022-02-20 18:55:02,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {34733#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_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;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; {34733#true} is VALID [2022-02-20 18:55:02,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {34733#true} assume 0 == ~r1~0; {34733#true} is VALID [2022-02-20 18:55:02,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {34733#true} assume ~id1~0 >= 0; {34733#true} is VALID [2022-02-20 18:55:02,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {34733#true} assume 0 == ~st1~0; {34735#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:02,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {34735#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {34735#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:02,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {34735#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {34735#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:02,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {34735#(<= ~st1~0 0)} assume ~id2~0 >= 0; {34735#(<= ~st1~0 0)} is VALID [2022-02-20 18:55:02,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {34735#(<= ~st1~0 0)} assume 0 == ~st2~0; {34736#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {34736#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {34736#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {34736#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {34736#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {34736#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {34736#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {34736#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {34737#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {34738#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:55:02,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {34739#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {34740#(<= (+ ~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_13301~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_13301~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume main_~main__i2~0#1 < 12;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0); {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,635 INFO L290 TraceCheckUtils]: 52: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,635 INFO L290 TraceCheckUtils]: 53: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,636 INFO L290 TraceCheckUtils]: 55: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send3~0 != ~nomsg~0); {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,640 INFO L290 TraceCheckUtils]: 60: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send5~0 != ~nomsg~0); {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,645 INFO L290 TraceCheckUtils]: 69: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,647 INFO L290 TraceCheckUtils]: 72: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,647 INFO L290 TraceCheckUtils]: 73: Hoare triple {34740#(<= (+ ~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; {34740#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:55:02,648 INFO L290 TraceCheckUtils]: 74: Hoare triple {34740#(<= (+ ~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; {34734#false} is VALID [2022-02-20 18:55:02,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {34734#false} ~__return_13434~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_13434~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; {34734#false} is VALID [2022-02-20 18:55:02,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {34734#false} assume 0 == main_~assert__arg~0#1 % 256; {34734#false} is VALID [2022-02-20 18:55:02,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {34734#false} assume !false; {34734#false} is VALID [2022-02-20 18:55:02,648 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:55:02,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:55:02,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608310289] [2022-02-20 18:55:02,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608310289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:55:02,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:55:02,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:55:02,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333964716] [2022-02-20 18:55:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:55:02,650 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:02,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:55:02,650 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:55:02,699 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:55:02,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:55:02,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:55:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:55:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:55:02,700 INFO L87 Difference]: Start difference. First operand 2861 states and 4396 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)