./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f7a5a1c3d43a07fad050d83cae91745968fcd759f4b97582e892f295162805b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:53:47,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:53:47,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:53:47,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:53:47,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:53:47,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:53:47,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:53:47,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:53:47,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:53:47,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:53:47,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:53:47,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:53:47,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:53:47,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:53:47,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:53:47,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:53:47,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:53:47,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:53:47,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:53:47,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:53:47,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:53:47,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:53:47,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:53:47,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:53:47,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:53:47,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:53:47,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:53:47,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:53:47,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:53:47,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:53:47,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:53:47,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:53:47,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:53:47,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:53:47,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:53:47,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:53:47,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:53:47,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:53:47,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:53:47,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:53:47,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:53:47,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:53:47,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:53:47,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:53:47,210 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:53:47,210 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:53:47,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:53:47,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:53:47,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:53:47,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:53:47,212 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:53:47,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:53:47,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:53:47,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:53:47,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:53:47,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:53:47,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:53:47,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:53:47,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:53:47,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:53:47,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:53:47,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:53:47,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:53:47,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:53:47,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:53:47,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:53:47,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:47,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:53:47,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:53:47,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:53:47,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:53:47,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:53:47,217 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:53:47,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:53:47,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:53:47,218 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 -> 7f7a5a1c3d43a07fad050d83cae91745968fcd759f4b97582e892f295162805b [2022-02-20 18:53:47,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:53:47,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:53:47,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:53:47,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:53:47,473 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:53:47,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:53:47,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892615ad1/918de7675b874002b8b4103d443a2882/FLAG89e8e701a [2022-02-20 18:53:47,978 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:53:47,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:53:47,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892615ad1/918de7675b874002b8b4103d443a2882/FLAG89e8e701a [2022-02-20 18:53:48,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892615ad1/918de7675b874002b8b4103d443a2882 [2022-02-20 18:53:48,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:53:48,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:53:48,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:48,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:53:48,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:53:48,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c6d79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48, skipping insertion in model container [2022-02-20 18:53:48,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:53:48,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:53:48,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5805,5818] [2022-02-20 18:53:48,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:48,674 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:53:48,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[5805,5818] [2022-02-20 18:53:48,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:53:48,787 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:53:48,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48 WrapperNode [2022-02-20 18:53:48,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:53:48,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:48,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:53:48,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:53:48,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,846 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 413 [2022-02-20 18:53:48,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:53:48,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:53:48,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:53:48,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:53:48,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:53:48,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:53:48,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:53:48,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:53:48,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (1/1) ... [2022-02-20 18:53:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:53:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:53:48,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:53:48,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:53:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:53:48,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:53:49,040 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:53:49,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:53:49,668 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:53:49,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:53:49,678 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:53:49,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:49 BoogieIcfgContainer [2022-02-20 18:53:49,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:53:49,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:53:49,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:53:49,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:53:49,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:53:48" (1/3) ... [2022-02-20 18:53:49,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31da808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:49, skipping insertion in model container [2022-02-20 18:53:49,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:53:48" (2/3) ... [2022-02-20 18:53:49,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31da808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:53:49, skipping insertion in model container [2022-02-20 18:53:49,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:53:49" (3/3) ... [2022-02-20 18:53:49,688 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:53:49,692 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:53:49,693 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:53:49,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:53:49,754 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:53:49,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:53:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 98 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:53:49,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:49,799 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] [2022-02-20 18:53:49,800 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1055716622, now seen corresponding path program 1 times [2022-02-20 18:53:49,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:49,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028248723] [2022-02-20 18:53:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:50,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {102#true} is VALID [2022-02-20 18:53:50,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {102#true} is VALID [2022-02-20 18:53:50,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {102#true} assume 0 == ~r1~0 % 256; {102#true} is VALID [2022-02-20 18:53:50,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {102#true} assume ~id1~0 >= 0; {102#true} is VALID [2022-02-20 18:53:50,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {102#true} assume 0 == ~st1~0; {102#true} is VALID [2022-02-20 18:53:50,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {102#true} assume ~send1~0 == ~id1~0; {102#true} is VALID [2022-02-20 18:53:50,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {102#true} assume 0 == ~mode1~0 % 256; {102#true} is VALID [2022-02-20 18:53:50,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {102#true} assume ~id2~0 >= 0; {102#true} is VALID [2022-02-20 18:53:50,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {102#true} assume 0 == ~st2~0; {102#true} is VALID [2022-02-20 18:53:50,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {102#true} assume ~send2~0 == ~id2~0; {102#true} is VALID [2022-02-20 18:53:50,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {102#true} assume 0 == ~mode2~0 % 256; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {104#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {104#(= (+ (* (- 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; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {104#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:53:50,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {104#(= (+ (* (- 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; {103#false} is VALID [2022-02-20 18:53:50,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {103#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {103#false} is VALID [2022-02-20 18:53:50,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {103#false} ~mode2~0 := 0; {103#false} is VALID [2022-02-20 18:53:50,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {103#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:53:50,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {103#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:53:50,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {103#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {103#false} is VALID [2022-02-20 18:53:50,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {103#false} ~mode3~0 := 0; {103#false} is VALID [2022-02-20 18:53:50,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {103#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:53:50,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {103#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:53:50,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {103#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {103#false} is VALID [2022-02-20 18:53:50,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {103#false} ~mode4~0 := 0; {103#false} is VALID [2022-02-20 18:53:50,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {103#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:53:50,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {103#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {103#false} is VALID [2022-02-20 18:53:50,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {103#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {103#false} is VALID [2022-02-20 18:53:50,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {103#false} ~mode5~0 := 0; {103#false} is VALID [2022-02-20 18:53:50,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {103#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {103#false} is VALID [2022-02-20 18:53:50,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {103#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {103#false} is VALID [2022-02-20 18:53:50,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {103#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {103#false} is VALID [2022-02-20 18:53:50,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {103#false} assume 0 == main_~assert__arg~0#1 % 256; {103#false} is VALID [2022-02-20 18:53:50,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {103#false} assume !false; {103#false} is VALID [2022-02-20 18:53:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:50,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:50,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028248723] [2022-02-20 18:53:50,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028248723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:50,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:50,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:50,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503665183] [2022-02-20 18:53:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:53:50,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:50,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:50,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:50,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:50,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:50,345 INFO L87 Difference]: Start difference. First operand has 99 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 98 states have internal predecessors, (167), 0 states have call successors, (0), 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 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:50,700 INFO L93 Difference]: Finished difference Result 221 states and 356 transitions. [2022-02-20 18:53:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:50,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:53:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2022-02-20 18:53:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2022-02-20 18:53:50,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 356 transitions. [2022-02-20 18:53:51,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:51,070 INFO L225 Difference]: With dead ends: 221 [2022-02-20 18:53:51,070 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 18:53:51,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:51,076 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 108 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 337 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:53:51,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 337 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 18:53:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2022-02-20 18:53:51,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:51,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,113 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,114 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:51,122 INFO L93 Difference]: Finished difference Result 150 states and 216 transitions. [2022-02-20 18:53:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 216 transitions. [2022-02-20 18:53:51,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:51,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:51,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 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 150 states. [2022-02-20 18:53:51,124 INFO L87 Difference]: Start difference. First operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 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 150 states. [2022-02-20 18:53:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:51,131 INFO L93 Difference]: Finished difference Result 150 states and 216 transitions. [2022-02-20 18:53:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 216 transitions. [2022-02-20 18:53:51,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:51,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:51,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:51,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 215 transitions. [2022-02-20 18:53:51,141 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 215 transitions. Word has length 60 [2022-02-20 18:53:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:51,141 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 215 transitions. [2022-02-20 18:53:51,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 215 transitions. [2022-02-20 18:53:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:53:51,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:51,143 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] [2022-02-20 18:53:51,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:53:51,144 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 160325981, now seen corresponding path program 1 times [2022-02-20 18:53:51,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:51,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105397363] [2022-02-20 18:53:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:51,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {893#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {893#true} is VALID [2022-02-20 18:53:51,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {893#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {893#true} is VALID [2022-02-20 18:53:51,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {893#true} assume 0 == ~r1~0 % 256; {893#true} is VALID [2022-02-20 18:53:51,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {893#true} assume ~id1~0 >= 0; {893#true} is VALID [2022-02-20 18:53:51,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {893#true} assume 0 == ~st1~0; {893#true} is VALID [2022-02-20 18:53:51,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {893#true} assume ~send1~0 == ~id1~0; {893#true} is VALID [2022-02-20 18:53:51,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {893#true} assume 0 == ~mode1~0 % 256; {893#true} is VALID [2022-02-20 18:53:51,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {893#true} assume ~id2~0 >= 0; {893#true} is VALID [2022-02-20 18:53:51,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {893#true} assume 0 == ~st2~0; {893#true} is VALID [2022-02-20 18:53:51,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {893#true} assume ~send2~0 == ~id2~0; {893#true} is VALID [2022-02-20 18:53:51,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {893#true} assume 0 == ~mode2~0 % 256; {893#true} is VALID [2022-02-20 18:53:51,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {893#true} assume ~id3~0 >= 0; {893#true} is VALID [2022-02-20 18:53:51,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {893#true} assume 0 == ~st3~0; {893#true} is VALID [2022-02-20 18:53:51,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#true} assume ~send3~0 == ~id3~0; {893#true} is VALID [2022-02-20 18:53:51,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {893#true} assume 0 == ~mode3~0 % 256; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {895#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {895#(= (+ (* (- 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; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {895#(= (+ (* (- 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; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {895#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:53:51,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {895#(= (+ (* (- 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; {894#false} is VALID [2022-02-20 18:53:51,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {894#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {894#false} is VALID [2022-02-20 18:53:51,295 INFO L290 TraceCheckUtils]: 47: Hoare triple {894#false} ~mode3~0 := 0; {894#false} is VALID [2022-02-20 18:53:51,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {894#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {894#false} is VALID [2022-02-20 18:53:51,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {894#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {894#false} is VALID [2022-02-20 18:53:51,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {894#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {894#false} is VALID [2022-02-20 18:53:51,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {894#false} ~mode4~0 := 0; {894#false} is VALID [2022-02-20 18:53:51,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {894#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {894#false} is VALID [2022-02-20 18:53:51,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {894#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {894#false} is VALID [2022-02-20 18:53:51,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {894#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {894#false} is VALID [2022-02-20 18:53:51,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {894#false} ~mode5~0 := 0; {894#false} is VALID [2022-02-20 18:53:51,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {894#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {894#false} is VALID [2022-02-20 18:53:51,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {894#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {894#false} is VALID [2022-02-20 18:53:51,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {894#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {894#false} is VALID [2022-02-20 18:53:51,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {894#false} assume 0 == main_~assert__arg~0#1 % 256; {894#false} is VALID [2022-02-20 18:53:51,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {894#false} assume !false; {894#false} is VALID [2022-02-20 18:53:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:51,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:51,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105397363] [2022-02-20 18:53:51,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105397363] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:51,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:51,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:51,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100062382] [2022-02-20 18:53:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:53:51,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:51,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:51,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:51,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:51,349 INFO L87 Difference]: Start difference. First operand 148 states and 215 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:51,585 INFO L93 Difference]: Finished difference Result 360 states and 551 transitions. [2022-02-20 18:53:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 18:53:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:53:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:53:51,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 315 transitions. [2022-02-20 18:53:51,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:51,858 INFO L225 Difference]: With dead ends: 360 [2022-02-20 18:53:51,858 INFO L226 Difference]: Without dead ends: 246 [2022-02-20 18:53:51,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:51,860 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 78 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 287 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:53:51,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 287 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-20 18:53:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2022-02-20 18:53:51,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:51,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,900 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,900 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:51,909 INFO L93 Difference]: Finished difference Result 246 states and 368 transitions. [2022-02-20 18:53:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 368 transitions. [2022-02-20 18:53:51,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:51,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:51,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 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 246 states. [2022-02-20 18:53:51,917 INFO L87 Difference]: Start difference. First operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 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 246 states. [2022-02-20 18:53:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:51,925 INFO L93 Difference]: Finished difference Result 246 states and 368 transitions. [2022-02-20 18:53:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 368 transitions. [2022-02-20 18:53:51,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:51,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:51,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:51,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.5102880658436213) internal successors, (367), 243 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 367 transitions. [2022-02-20 18:53:51,936 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 367 transitions. Word has length 61 [2022-02-20 18:53:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:51,938 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 367 transitions. [2022-02-20 18:53:51,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 367 transitions. [2022-02-20 18:53:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:53:51,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:51,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:53:51,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:53:51,943 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2130731763, now seen corresponding path program 1 times [2022-02-20 18:53:51,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:51,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436380048] [2022-02-20 18:53:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:52,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {2207#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {2207#true} is VALID [2022-02-20 18:53:52,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {2207#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {2207#true} is VALID [2022-02-20 18:53:52,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {2207#true} assume 0 == ~r1~0 % 256; {2207#true} is VALID [2022-02-20 18:53:52,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {2207#true} assume ~id1~0 >= 0; {2207#true} is VALID [2022-02-20 18:53:52,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {2207#true} assume 0 == ~st1~0; {2207#true} is VALID [2022-02-20 18:53:52,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {2207#true} assume ~send1~0 == ~id1~0; {2207#true} is VALID [2022-02-20 18:53:52,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {2207#true} assume 0 == ~mode1~0 % 256; {2207#true} is VALID [2022-02-20 18:53:52,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {2207#true} assume ~id2~0 >= 0; {2207#true} is VALID [2022-02-20 18:53:52,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {2207#true} assume 0 == ~st2~0; {2207#true} is VALID [2022-02-20 18:53:52,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {2207#true} assume ~send2~0 == ~id2~0; {2207#true} is VALID [2022-02-20 18:53:52,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {2207#true} assume 0 == ~mode2~0 % 256; {2207#true} is VALID [2022-02-20 18:53:52,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {2207#true} assume ~id3~0 >= 0; {2207#true} is VALID [2022-02-20 18:53:52,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {2207#true} assume 0 == ~st3~0; {2207#true} is VALID [2022-02-20 18:53:52,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {2207#true} assume ~send3~0 == ~id3~0; {2207#true} is VALID [2022-02-20 18:53:52,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {2207#true} assume 0 == ~mode3~0 % 256; {2207#true} is VALID [2022-02-20 18:53:52,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {2207#true} assume ~id4~0 >= 0; {2207#true} is VALID [2022-02-20 18:53:52,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {2207#true} assume 0 == ~st4~0; {2207#true} is VALID [2022-02-20 18:53:52,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {2207#true} assume ~send4~0 == ~id4~0; {2207#true} is VALID [2022-02-20 18:53:52,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {2207#true} assume 0 == ~mode4~0 % 256; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {2209#(= (+ (* (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;main_~main__i2~0#1 := 0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {2209#(= (+ (* (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; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {2209#(= (+ (* (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; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0); {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {2209#(= (+ (* (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; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2209#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:53:52,123 INFO L290 TraceCheckUtils]: 50: Hoare triple {2209#(= (+ (* (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; {2208#false} is VALID [2022-02-20 18:53:52,123 INFO L290 TraceCheckUtils]: 51: Hoare triple {2208#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {2208#false} is VALID [2022-02-20 18:53:52,123 INFO L290 TraceCheckUtils]: 52: Hoare triple {2208#false} ~mode4~0 := 0; {2208#false} is VALID [2022-02-20 18:53:52,123 INFO L290 TraceCheckUtils]: 53: Hoare triple {2208#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {2208#false} is VALID [2022-02-20 18:53:52,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {2208#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2208#false} is VALID [2022-02-20 18:53:52,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {2208#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {2208#false} is VALID [2022-02-20 18:53:52,124 INFO L290 TraceCheckUtils]: 56: Hoare triple {2208#false} ~mode5~0 := 0; {2208#false} is VALID [2022-02-20 18:53:52,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {2208#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2208#false} is VALID [2022-02-20 18:53:52,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {2208#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {2208#false} is VALID [2022-02-20 18:53:52,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {2208#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {2208#false} is VALID [2022-02-20 18:53:52,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {2208#false} assume 0 == main_~assert__arg~0#1 % 256; {2208#false} is VALID [2022-02-20 18:53:52,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {2208#false} assume !false; {2208#false} is VALID [2022-02-20 18:53:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:52,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:52,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436380048] [2022-02-20 18:53:52,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436380048] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:52,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:52,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:52,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888997722] [2022-02-20 18:53:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:52,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:53:52,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:52,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:52,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:52,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:52,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:52,185 INFO L87 Difference]: Start difference. First operand 244 states and 367 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:52,419 INFO L93 Difference]: Finished difference Result 632 states and 981 transitions. [2022-02-20 18:53:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:52,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:53:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:53:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:53:52,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 315 transitions. [2022-02-20 18:53:52,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:52,660 INFO L225 Difference]: With dead ends: 632 [2022-02-20 18:53:52,660 INFO L226 Difference]: Without dead ends: 422 [2022-02-20 18:53:52,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:52,662 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 283 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:53:52,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 283 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-02-20 18:53:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2022-02-20 18:53:52,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:52,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,690 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,691 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:52,705 INFO L93 Difference]: Finished difference Result 422 states and 644 transitions. [2022-02-20 18:53:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 644 transitions. [2022-02-20 18:53:52,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:52,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:52,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 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 422 states. [2022-02-20 18:53:52,708 INFO L87 Difference]: Start difference. First operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 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 422 states. [2022-02-20 18:53:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:52,723 INFO L93 Difference]: Finished difference Result 422 states and 644 transitions. [2022-02-20 18:53:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 644 transitions. [2022-02-20 18:53:52,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:52,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:52,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:52,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.5346062052505967) internal successors, (643), 419 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 643 transitions. [2022-02-20 18:53:52,741 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 643 transitions. Word has length 62 [2022-02-20 18:53:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:52,742 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 643 transitions. [2022-02-20 18:53:52,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 643 transitions. [2022-02-20 18:53:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:53:52,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:52,743 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] [2022-02-20 18:53:52,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:53:52,743 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:52,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2078468845, now seen corresponding path program 1 times [2022-02-20 18:53:52,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:52,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855144260] [2022-02-20 18:53:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:52,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {4504#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {4504#true} is VALID [2022-02-20 18:53:52,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {4504#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {4504#true} is VALID [2022-02-20 18:53:52,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {4504#true} assume 0 == ~r1~0 % 256; {4504#true} is VALID [2022-02-20 18:53:52,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {4504#true} assume ~id1~0 >= 0; {4504#true} is VALID [2022-02-20 18:53:52,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {4504#true} assume 0 == ~st1~0; {4504#true} is VALID [2022-02-20 18:53:52,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {4504#true} assume ~send1~0 == ~id1~0; {4504#true} is VALID [2022-02-20 18:53:52,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {4504#true} assume 0 == ~mode1~0 % 256; {4504#true} is VALID [2022-02-20 18:53:52,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {4504#true} assume ~id2~0 >= 0; {4504#true} is VALID [2022-02-20 18:53:52,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {4504#true} assume 0 == ~st2~0; {4504#true} is VALID [2022-02-20 18:53:52,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {4504#true} assume ~send2~0 == ~id2~0; {4504#true} is VALID [2022-02-20 18:53:52,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {4504#true} assume 0 == ~mode2~0 % 256; {4504#true} is VALID [2022-02-20 18:53:52,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {4504#true} assume ~id3~0 >= 0; {4504#true} is VALID [2022-02-20 18:53:52,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {4504#true} assume 0 == ~st3~0; {4504#true} is VALID [2022-02-20 18:53:52,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {4504#true} assume ~send3~0 == ~id3~0; {4504#true} is VALID [2022-02-20 18:53:52,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {4504#true} assume 0 == ~mode3~0 % 256; {4504#true} is VALID [2022-02-20 18:53:52,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {4504#true} assume ~id4~0 >= 0; {4504#true} is VALID [2022-02-20 18:53:52,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {4504#true} assume 0 == ~st4~0; {4504#true} is VALID [2022-02-20 18:53:52,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {4504#true} assume ~send4~0 == ~id4~0; {4504#true} is VALID [2022-02-20 18:53:52,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {4504#true} assume 0 == ~mode4~0 % 256; {4504#true} is VALID [2022-02-20 18:53:52,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {4504#true} assume ~id5~0 >= 0; {4504#true} is VALID [2022-02-20 18:53:52,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {4504#true} assume 0 == ~st5~0; {4504#true} is VALID [2022-02-20 18:53:52,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {4504#true} assume ~send5~0 == ~id5~0; {4504#true} is VALID [2022-02-20 18:53:52,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {4504#true} assume 0 == ~mode5~0 % 256; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {4506#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {4506#(= (+ (* (- 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; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0); {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {4506#(= (+ (* (- 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; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0); {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,841 INFO L290 TraceCheckUtils]: 47: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,841 INFO L290 TraceCheckUtils]: 48: Hoare triple {4506#(= (+ (* (- 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; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,843 INFO L290 TraceCheckUtils]: 51: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {4506#(= (+ (* (- 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; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,844 INFO L290 TraceCheckUtils]: 54: Hoare triple {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {4506#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:53:52,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {4506#(= (+ (* (- 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; {4505#false} is VALID [2022-02-20 18:53:52,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {4505#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {4505#false} is VALID [2022-02-20 18:53:52,845 INFO L290 TraceCheckUtils]: 57: Hoare triple {4505#false} ~mode5~0 := 0; {4505#false} is VALID [2022-02-20 18:53:52,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {4505#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4505#false} is VALID [2022-02-20 18:53:52,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {4505#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {4505#false} is VALID [2022-02-20 18:53:52,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {4505#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {4505#false} is VALID [2022-02-20 18:53:52,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {4505#false} assume 0 == main_~assert__arg~0#1 % 256; {4505#false} is VALID [2022-02-20 18:53:52,846 INFO L290 TraceCheckUtils]: 62: Hoare triple {4505#false} assume !false; {4505#false} is VALID [2022-02-20 18:53:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:52,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:52,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855144260] [2022-02-20 18:53:52,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855144260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:52,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:52,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:53:52,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969351761] [2022-02-20 18:53:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:52,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:52,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:52,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:52,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:52,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:53:52,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:52,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:53:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:52,901 INFO L87 Difference]: Start difference. First operand 420 states and 643 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:53,178 INFO L93 Difference]: Finished difference Result 1128 states and 1757 transitions. [2022-02-20 18:53:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:53:53,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 18:53:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:53:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:53:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2022-02-20 18:53:53,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 315 transitions. [2022-02-20 18:53:53,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:53,455 INFO L225 Difference]: With dead ends: 1128 [2022-02-20 18:53:53,455 INFO L226 Difference]: Without dead ends: 742 [2022-02-20 18:53:53,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:53:53,457 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 279 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:53:53,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 279 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:53:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-02-20 18:53:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2022-02-20 18:53:53,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:53:53,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 742 states. Second operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,500 INFO L74 IsIncluded]: Start isIncluded. First operand 742 states. Second operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,501 INFO L87 Difference]: Start difference. First operand 742 states. Second operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:53,528 INFO L93 Difference]: Finished difference Result 742 states and 1140 transitions. [2022-02-20 18:53:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1140 transitions. [2022-02-20 18:53:53,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:53,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:53,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 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 742 states. [2022-02-20 18:53:53,533 INFO L87 Difference]: Start difference. First operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 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 742 states. [2022-02-20 18:53:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:53:53,559 INFO L93 Difference]: Finished difference Result 742 states and 1140 transitions. [2022-02-20 18:53:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1140 transitions. [2022-02-20 18:53:53,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:53:53,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:53:53,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:53:53,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:53:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.5412719891745603) internal successors, (1139), 739 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1139 transitions. [2022-02-20 18:53:53,595 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1139 transitions. Word has length 63 [2022-02-20 18:53:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:53:53,595 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 1139 transitions. [2022-02-20 18:53:53,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1139 transitions. [2022-02-20 18:53:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:53:53,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:53:53,596 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] [2022-02-20 18:53:53,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:53:53,597 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:53:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:53:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1380036385, now seen corresponding path program 1 times [2022-02-20 18:53:53,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:53:53,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556999467] [2022-02-20 18:53:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:53:53,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:53:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:53:53,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {8593#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {8593#true} is VALID [2022-02-20 18:53:53,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {8593#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {8593#true} is VALID [2022-02-20 18:53:53,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {8593#true} assume 0 == ~r1~0 % 256; {8593#true} is VALID [2022-02-20 18:53:53,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {8593#true} assume ~id1~0 >= 0; {8593#true} is VALID [2022-02-20 18:53:53,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {8593#true} assume 0 == ~st1~0; {8595#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {8595#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {8595#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {8595#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {8595#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {8595#(<= ~st1~0 0)} assume ~id2~0 >= 0; {8595#(<= ~st1~0 0)} is VALID [2022-02-20 18:53:53,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {8595#(<= ~st1~0 0)} assume 0 == ~st2~0; {8596#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {8596#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {8596#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {8596#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {8596#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {8596#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {8596#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {8596#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {8597#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {8598#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0); {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,727 INFO L290 TraceCheckUtils]: 51: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 != ~nomsg~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~nomsg~0); {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:53:53,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {8599#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {8594#false} is VALID [2022-02-20 18:53:53,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {8594#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {8594#false} is VALID [2022-02-20 18:53:53,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {8594#false} assume 0 == main_~assert__arg~0#1 % 256; {8594#false} is VALID [2022-02-20 18:53:53,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {8594#false} assume !false; {8594#false} is VALID [2022-02-20 18:53:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:53:53,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:53:53,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556999467] [2022-02-20 18:53:53,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556999467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:53:53,734 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:53:53,734 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:53:53,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682361971] [2022-02-20 18:53:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:53:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:53:53,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:53:53,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:53:53,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:53:53,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:53:53,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:53:53,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:53:53,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:53:53,804 INFO L87 Difference]: Start difference. First operand 740 states and 1139 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:01,724 INFO L93 Difference]: Finished difference Result 7800 states and 12189 transitions. [2022-02-20 18:54:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:54:01,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:54:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1112 transitions. [2022-02-20 18:54:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1112 transitions. [2022-02-20 18:54:01,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1112 transitions. [2022-02-20 18:54:02,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1112 edges. 1112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:04,729 INFO L225 Difference]: With dead ends: 7800 [2022-02-20 18:54:04,729 INFO L226 Difference]: Without dead ends: 7094 [2022-02-20 18:54:04,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:54:04,738 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 1198 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:04,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 1762 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2022-02-20 18:54:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 1444. [2022-02-20 18:54:06,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:06,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7094 states. Second operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call 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:06,124 INFO L74 IsIncluded]: Start isIncluded. First operand 7094 states. Second operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call 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:06,126 INFO L87 Difference]: Start difference. First operand 7094 states. Second operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call 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:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:07,486 INFO L93 Difference]: Finished difference Result 7094 states and 10924 transitions. [2022-02-20 18:54:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 10924 transitions. [2022-02-20 18:54:07,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:07,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:07,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 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 7094 states. [2022-02-20 18:54:07,503 INFO L87 Difference]: Start difference. First operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 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 7094 states. [2022-02-20 18:54:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:08,990 INFO L93 Difference]: Finished difference Result 7094 states and 10924 transitions. [2022-02-20 18:54:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7094 states and 10924 transitions. [2022-02-20 18:54:09,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:09,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:09,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:09,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.5322245322245323) internal successors, (2211), 1443 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call 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:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2211 transitions. [2022-02-20 18:54:09,108 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2211 transitions. Word has length 64 [2022-02-20 18:54:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:09,108 INFO L470 AbstractCegarLoop]: Abstraction has 1444 states and 2211 transitions. [2022-02-20 18:54:09,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call 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:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2211 transitions. [2022-02-20 18:54:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:54:09,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:09,109 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] [2022-02-20 18:54:09,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:54:09,110 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash 8107643, now seen corresponding path program 1 times [2022-02-20 18:54:09,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:09,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965522536] [2022-02-20 18:54:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:09,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {35793#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {35793#true} is VALID [2022-02-20 18:54:09,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {35793#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {35793#true} is VALID [2022-02-20 18:54:09,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {35793#true} assume 0 == ~r1~0 % 256; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 != ~nomsg~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,222 INFO L290 TraceCheckUtils]: 39: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send2~0 != ~nomsg~0); {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send3~0 != ~nomsg~0); {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send5~0 != ~nomsg~0); {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~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; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:54:09,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {35795#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 5; {35794#false} is VALID [2022-02-20 18:54:09,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {35794#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1; {35794#false} is VALID [2022-02-20 18:54:09,231 INFO L290 TraceCheckUtils]: 63: Hoare triple {35794#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {35794#false} is VALID [2022-02-20 18:54:09,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {35794#false} assume 0 == main_~assert__arg~0#1 % 256; {35794#false} is VALID [2022-02-20 18:54:09,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {35794#false} assume !false; {35794#false} is VALID [2022-02-20 18:54:09,236 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:09,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:09,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965522536] [2022-02-20 18:54:09,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965522536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:09,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:09,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:09,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221147821] [2022-02-20 18:54:09,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:09,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:54:09,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:09,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:09,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:09,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:09,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:09,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:09,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:09,284 INFO L87 Difference]: Start difference. First operand 1444 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:12,716 INFO L93 Difference]: Finished difference Result 4088 states and 6261 transitions. [2022-02-20 18:54:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:12,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:54:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:54:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2022-02-20 18:54:12,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 319 transitions. [2022-02-20 18:54:12,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:13,191 INFO L225 Difference]: With dead ends: 4088 [2022-02-20 18:54:13,191 INFO L226 Difference]: Without dead ends: 2678 [2022-02-20 18:54:13,192 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:13,193 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:13,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 221 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:54:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2022-02-20 18:54:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 2644. [2022-02-20 18:54:15,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:15,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2678 states. Second operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call 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:15,810 INFO L74 IsIncluded]: Start isIncluded. First operand 2678 states. Second operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call 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:15,814 INFO L87 Difference]: Start difference. First operand 2678 states. Second operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call 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:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:16,032 INFO L93 Difference]: Finished difference Result 2678 states and 4004 transitions. [2022-02-20 18:54:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 4004 transitions. [2022-02-20 18:54:16,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:16,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:16,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 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 2678 states. [2022-02-20 18:54:16,044 INFO L87 Difference]: Start difference. First operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 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 2678 states. [2022-02-20 18:54:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:16,253 INFO L93 Difference]: Finished difference Result 2678 states and 4004 transitions. [2022-02-20 18:54:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 4004 transitions. [2022-02-20 18:54:16,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:16,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:16,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:16,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.5024593265228907) internal successors, (3971), 2643 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call 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:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3971 transitions. [2022-02-20 18:54:16,548 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3971 transitions. Word has length 66 [2022-02-20 18:54:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:16,548 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3971 transitions. [2022-02-20 18:54:16,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3971 transitions. [2022-02-20 18:54:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:54:16,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:16,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:54:16,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:54:16,550 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:16,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash 29110298, now seen corresponding path program 1 times [2022-02-20 18:54:16,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:16,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118276724] [2022-02-20 18:54:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:16,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {50638#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {50638#true} is VALID [2022-02-20 18:54:16,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {50638#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {50638#true} is VALID [2022-02-20 18:54:16,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {50638#true} assume 0 == ~r1~0 % 256; {50638#true} is VALID [2022-02-20 18:54:16,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {50638#true} assume ~id1~0 >= 0; {50638#true} is VALID [2022-02-20 18:54:16,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {50638#true} assume 0 == ~st1~0; {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:16,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~send1~0 == ~id1~0; {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:16,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~mode1~0 % 256; {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:16,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume ~id2~0 >= 0; {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} is VALID [2022-02-20 18:54:16,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {50640#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)))} assume 0 == ~st2~0; {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:16,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:16,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:16,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:54:16,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {50641#(and (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {50642#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send4~0 == ~id4~0; {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode4~0 % 256; {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id5~0 >= 0; {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:54:16,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {50643#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st5~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send5~0 == ~id5~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode5~0 % 256; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id4~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id5~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id4~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id5~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id4~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id3~0 != ~id5~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0); {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send3~0 != ~nomsg~0); {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,798 INFO L290 TraceCheckUtils]: 49: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,798 INFO L290 TraceCheckUtils]: 50: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send4~0 != ~nomsg~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send5~0 != ~nomsg~0); {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,803 INFO L290 TraceCheckUtils]: 59: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 % 256 >= 5); {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:54:16,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {50644#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0);main_~check__tmp~0#1 := 0; {50639#false} is VALID [2022-02-20 18:54:16,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {50639#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {50639#false} is VALID [2022-02-20 18:54:16,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {50639#false} assume 0 == main_~assert__arg~0#1 % 256; {50639#false} is VALID [2022-02-20 18:54:16,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {50639#false} assume !false; {50639#false} is VALID [2022-02-20 18:54:16,806 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:16,806 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:16,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118276724] [2022-02-20 18:54:16,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118276724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:16,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:16,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:54:16,807 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914640192] [2022-02-20 18:54:16,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:16,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:54:16,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:16,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:16,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:16,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:54:16,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:16,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:54:16,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:16,866 INFO L87 Difference]: Start difference. First operand 2644 states and 3971 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:21,242 INFO L93 Difference]: Finished difference Result 5256 states and 7909 transitions. [2022-02-20 18:54:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:54:21,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:54:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 326 transitions. [2022-02-20 18:54:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call 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:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 326 transitions. [2022-02-20 18:54:21,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 326 transitions. [2022-02-20 18:54:21,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:21,742 INFO L225 Difference]: With dead ends: 5256 [2022-02-20 18:54:21,742 INFO L226 Difference]: Without dead ends: 2646 [2022-02-20 18:54:21,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:54:21,744 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 254 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:21,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 600 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2022-02-20 18:54:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2022-02-20 18:54:24,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:24,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2646 states. Second operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,597 INFO L74 IsIncluded]: Start isIncluded. First operand 2646 states. Second operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,599 INFO L87 Difference]: Start difference. First operand 2646 states. Second operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:24,821 INFO L93 Difference]: Finished difference Result 2646 states and 3940 transitions. [2022-02-20 18:54:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3940 transitions. [2022-02-20 18:54:24,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:24,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:24,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 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 2646 states. [2022-02-20 18:54:24,829 INFO L87 Difference]: Start difference. First operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 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 2646 states. [2022-02-20 18:54:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:25,082 INFO L93 Difference]: Finished difference Result 2646 states and 3940 transitions. [2022-02-20 18:54:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3940 transitions. [2022-02-20 18:54:25,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:25,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:25,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:25,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2643 states have (on average 1.4903518728717366) internal successors, (3939), 2643 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3939 transitions. [2022-02-20 18:54:25,362 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3939 transitions. Word has length 66 [2022-02-20 18:54:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:25,362 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3939 transitions. [2022-02-20 18:54:25,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3939 transitions. [2022-02-20 18:54:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:54:25,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:25,363 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] [2022-02-20 18:54:25,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:54:25,364 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash 849093681, now seen corresponding path program 1 times [2022-02-20 18:54:25,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:25,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859008567] [2022-02-20 18:54:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:25,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {67061#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {67061#true} is VALID [2022-02-20 18:54:25,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {67061#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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {67061#true} is VALID [2022-02-20 18:54:25,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {67061#true} assume 0 == ~r1~0 % 256; {67061#true} is VALID [2022-02-20 18:54:25,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {67061#true} assume ~id1~0 >= 0; {67061#true} is VALID [2022-02-20 18:54:25,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {67061#true} assume 0 == ~st1~0; {67061#true} is VALID [2022-02-20 18:54:25,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {67061#true} assume ~send1~0 == ~id1~0; {67061#true} is VALID [2022-02-20 18:54:25,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {67061#true} assume 0 == ~mode1~0 % 256; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {67063#(= (+ (* (- 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;main_~main__i2~0#1 := 0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:54:25,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {67063#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {67062#false} is VALID [2022-02-20 18:54:25,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {67062#false} assume !(255 == ~r1~0 % 256); {67062#false} is VALID [2022-02-20 18:54:25,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {67062#false} ~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {67062#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {67062#false} ~mode1~0 := 0; {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {67062#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {67062#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {67062#false} assume !(~send2~0 != ~nomsg~0); {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {67062#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {67062#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {67062#false} is VALID [2022-02-20 18:54:25,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {67062#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {67062#false} is VALID [2022-02-20 18:54:25,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {67062#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {67062#false} is VALID [2022-02-20 18:54:25,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {67062#false} assume !(~send3~0 != ~nomsg~0); {67062#false} is VALID [2022-02-20 18:54:25,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {67062#false} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {67062#false} is VALID [2022-02-20 18:54:25,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {67062#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {67062#false} is VALID [2022-02-20 18:54:25,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {67062#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {67062#false} is VALID [2022-02-20 18:54:25,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {67062#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {67062#false} is VALID [2022-02-20 18:54:25,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {67062#false} assume ~send4~0 != ~nomsg~0; {67062#false} is VALID [2022-02-20 18:54:25,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {67062#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {67062#false} is VALID [2022-02-20 18:54:25,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {67062#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {67062#false} is VALID [2022-02-20 18:54:25,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {67062#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {67062#false} is VALID [2022-02-20 18:54:25,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {67062#false} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {67062#false} is VALID [2022-02-20 18:54:25,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {67062#false} assume !(~send5~0 != ~nomsg~0); {67062#false} is VALID [2022-02-20 18:54:25,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {67062#false} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {67062#false} is VALID [2022-02-20 18:54:25,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {67062#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {67062#false} is VALID [2022-02-20 18:54:25,426 INFO L290 TraceCheckUtils]: 60: Hoare triple {67062#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {67062#false} is VALID [2022-02-20 18:54:25,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {67062#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {67062#false} is VALID [2022-02-20 18:54:25,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {67062#false} assume ~r1~0 % 256 >= 5; {67062#false} is VALID [2022-02-20 18:54:25,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {67062#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1; {67062#false} is VALID [2022-02-20 18:54:25,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {67062#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {67062#false} is VALID [2022-02-20 18:54:25,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {67062#false} assume 0 == main_~assert__arg~0#1 % 256; {67062#false} is VALID [2022-02-20 18:54:25,426 INFO L290 TraceCheckUtils]: 66: Hoare triple {67062#false} assume !false; {67062#false} is VALID [2022-02-20 18:54:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:54:25,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:25,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859008567] [2022-02-20 18:54:25,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859008567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:25,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:25,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:54:25,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565508668] [2022-02-20 18:54:25,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:54:25,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:25,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:25,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:25,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:54:25,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:25,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:54:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:54:25,481 INFO L87 Difference]: Start difference. First operand 2644 states and 3939 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call 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:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:30,513 INFO L93 Difference]: Finished difference Result 5147 states and 7753 transitions. [2022-02-20 18:54:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:54:30,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:54:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call 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:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2022-02-20 18:54:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call 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:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2022-02-20 18:54:30,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 312 transitions. [2022-02-20 18:54:30,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:31,290 INFO L225 Difference]: With dead ends: 5147 [2022-02-20 18:54:31,290 INFO L226 Difference]: Without dead ends: 3736 [2022-02-20 18:54:31,292 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:31,293 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 85 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 299 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:31,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 299 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:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-02-20 18:54:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3734. [2022-02-20 18:54:35,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:54:35,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3736 states. Second operand has 3734 states, 3733 states have (on average 1.4886150549156174) internal successors, (5557), 3733 states have internal predecessors, (5557), 0 states have call successors, (0), 0 states have call 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:35,119 INFO L74 IsIncluded]: Start isIncluded. First operand 3736 states. Second operand has 3734 states, 3733 states have (on average 1.4886150549156174) internal successors, (5557), 3733 states have internal predecessors, (5557), 0 states have call successors, (0), 0 states have call 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:35,122 INFO L87 Difference]: Start difference. First operand 3736 states. Second operand has 3734 states, 3733 states have (on average 1.4886150549156174) internal successors, (5557), 3733 states have internal predecessors, (5557), 0 states have call successors, (0), 0 states have call 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:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:35,514 INFO L93 Difference]: Finished difference Result 3736 states and 5558 transitions. [2022-02-20 18:54:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 5558 transitions. [2022-02-20 18:54:35,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:35,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:35,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 3734 states, 3733 states have (on average 1.4886150549156174) internal successors, (5557), 3733 states have internal predecessors, (5557), 0 states have call successors, (0), 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 3736 states. [2022-02-20 18:54:35,523 INFO L87 Difference]: Start difference. First operand has 3734 states, 3733 states have (on average 1.4886150549156174) internal successors, (5557), 3733 states have internal predecessors, (5557), 0 states have call successors, (0), 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 3736 states. [2022-02-20 18:54:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:35,909 INFO L93 Difference]: Finished difference Result 3736 states and 5558 transitions. [2022-02-20 18:54:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 5558 transitions. [2022-02-20 18:54:35,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:54:35,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:54:35,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:54:35,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:54:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3733 states have (on average 1.4886150549156174) internal successors, (5557), 3733 states have internal predecessors, (5557), 0 states have call successors, (0), 0 states have call 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:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 5557 transitions. [2022-02-20 18:54:36,487 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 5557 transitions. Word has length 67 [2022-02-20 18:54:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:54:36,487 INFO L470 AbstractCegarLoop]: Abstraction has 3734 states and 5557 transitions. [2022-02-20 18:54:36,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call 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:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 5557 transitions. [2022-02-20 18:54:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:54:36,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:54:36,490 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] [2022-02-20 18:54:36,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:54:36,490 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:54:36,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:54:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 900509886, now seen corresponding path program 1 times [2022-02-20 18:54:36,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:54:36,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559352433] [2022-02-20 18:54:36,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:54:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:54:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:54:36,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {87037#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_6147~0 := 0;~__return_6261~0 := 0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_~init__tmp~0#1; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {87039#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:54:36,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {87039#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {87040#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:54:36,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {87040#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {87040#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:54:36,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {87040#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_6147~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6147~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send1~0 != ~nomsg~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~nomsg~0); {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,610 INFO L290 TraceCheckUtils]: 45: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~nomsg~0); {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~send4~0 != ~nomsg~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {87041#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:54:36,614 INFO L290 TraceCheckUtils]: 56: Hoare triple {87041#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0); {87038#false} is VALID [2022-02-20 18:54:36,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {87038#false} main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {87038#false} is VALID [2022-02-20 18:54:36,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {87038#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {87038#false} is VALID [2022-02-20 18:54:36,614 INFO L290 TraceCheckUtils]: 59: Hoare triple {87038#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {87038#false} is VALID [2022-02-20 18:54:36,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {87038#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {87038#false} is VALID [2022-02-20 18:54:36,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {87038#false} assume !(~r1~0 % 256 >= 5); {87038#false} is VALID [2022-02-20 18:54:36,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {87038#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {87038#false} is VALID [2022-02-20 18:54:36,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {87038#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1; {87038#false} is VALID [2022-02-20 18:54:36,615 INFO L290 TraceCheckUtils]: 64: Hoare triple {87038#false} ~__return_6261~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6261~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; {87038#false} is VALID [2022-02-20 18:54:36,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {87038#false} assume 0 == main_~assert__arg~0#1 % 256; {87038#false} is VALID [2022-02-20 18:54:36,615 INFO L290 TraceCheckUtils]: 66: Hoare triple {87038#false} assume !false; {87038#false} is VALID [2022-02-20 18:54:36,615 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:36,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:54:36,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559352433] [2022-02-20 18:54:36,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559352433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:54:36,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:54:36,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:54:36,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522463832] [2022-02-20 18:54:36,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:54:36,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:54:36,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:54:36,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call 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:36,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:36,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:54:36,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:54:36,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:54:36,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:54:36,663 INFO L87 Difference]: Start difference. First operand 3734 states and 5557 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:54:44,989 INFO L93 Difference]: Finished difference Result 7432 states and 11078 transitions. [2022-02-20 18:54:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:54:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:54:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:54:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2022-02-20 18:54:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:54:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2022-02-20 18:54:44,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 230 transitions. [2022-02-20 18:54:45,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:54:45,729 INFO L225 Difference]: With dead ends: 7432 [2022-02-20 18:54:45,729 INFO L226 Difference]: Without dead ends: 3734 [2022-02-20 18:54:45,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:54:45,733 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 294 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:54:45,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 117 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:54:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states.