./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.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.7.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 50e151318da71693ecfd101451d51852511de48fd25109c1f84fed946653f0cd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:56:43,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:56:43,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:56:43,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:56:43,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:56:43,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:56:43,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:56:43,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:56:43,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:56:43,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:56:43,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:56:43,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:56:43,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:56:43,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:56:43,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:56:43,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:56:43,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:56:43,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:56:43,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:56:43,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:56:43,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:56:43,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:56:43,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:56:43,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:56:43,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:56:43,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:56:43,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:56:43,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:56:43,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:56:43,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:56:43,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:56:43,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:56:43,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:56:43,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:56:43,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:56:43,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:56:43,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:56:43,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:56:43,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:56:43,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:56:43,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:56:43,144 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:56:43,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:56:43,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:56:43,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:56:43,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:56:43,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:56:43,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:56:43,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:56:43,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:56:43,175 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:56:43,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:56:43,176 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:56:43,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:56:43,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:56:43,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:56:43,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:56:43,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:56:43,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:56:43,177 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:56:43,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:56:43,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:56:43,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:56:43,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:56:43,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:56:43,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:56:43,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:43,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:56:43,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:56:43,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:56:43,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:56:43,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:56:43,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:56:43,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:56:43,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:56:43,181 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 -> 50e151318da71693ecfd101451d51852511de48fd25109c1f84fed946653f0cd [2022-02-20 18:56:43,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:56:43,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:56:43,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:56:43,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:56:43,418 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:56:43,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:56:43,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b2dfa2f/46a8001dfb3446ef97dbc4a039085e15/FLAG42ba7d5b2 [2022-02-20 18:56:43,890 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:56:43,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:56:43,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b2dfa2f/46a8001dfb3446ef97dbc4a039085e15/FLAG42ba7d5b2 [2022-02-20 18:56:43,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b2dfa2f/46a8001dfb3446ef97dbc4a039085e15 [2022-02-20 18:56:43,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:56:43,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:56:43,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:43,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:56:43,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:56:43,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:43" (1/1) ... [2022-02-20 18:56:43,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47599ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:43, skipping insertion in model container [2022-02-20 18:56:43,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:56:43" (1/1) ... [2022-02-20 18:56:43,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:56:43,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:56:44,171 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.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7667,7680] [2022-02-20 18:56:44,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:44,221 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:56:44,276 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.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7667,7680] [2022-02-20 18:56:44,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:56:44,317 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:56:44,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44 WrapperNode [2022-02-20 18:56:44,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:56:44,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:44,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:56:44,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:56:44,325 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:56:44" (1/1) ... [2022-02-20 18:56:44,345 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:56:44" (1/1) ... [2022-02-20 18:56:44,386 INFO L137 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 572 [2022-02-20 18:56:44,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:56:44,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:56:44,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:56:44,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:56:44,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:56:44,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:56:44,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:56:44,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:56:44,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (1/1) ... [2022-02-20 18:56:44,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:56:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:56:44,452 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:56:44,480 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:56:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:56:44,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:56:44,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:56:44,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:56:44,633 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:56:44,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:56:45,276 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:56:45,284 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:56:45,284 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:56:45,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:45 BoogieIcfgContainer [2022-02-20 18:56:45,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:56:45,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:56:45,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:56:45,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:56:45,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:56:43" (1/3) ... [2022-02-20 18:56:45,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a16445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:45, skipping insertion in model container [2022-02-20 18:56:45,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:56:44" (2/3) ... [2022-02-20 18:56:45,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a16445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:56:45, skipping insertion in model container [2022-02-20 18:56:45,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:56:45" (3/3) ... [2022-02-20 18:56:45,292 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:56:45,296 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:56:45,296 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:56:45,334 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:56:45,341 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:56:45,341 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:56:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-20 18:56:45,368 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:45,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:45,370 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:45,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2006546999, now seen corresponding path program 1 times [2022-02-20 18:56:45,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:45,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589110518] [2022-02-20 18:56:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:45,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:45,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28296~0 := 0;~__return_28448~0 := 0; {141#true} is VALID [2022-02-20 18:56:45,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {141#true} is VALID [2022-02-20 18:56:45,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume 0 == ~r1~0 % 256; {141#true} is VALID [2022-02-20 18:56:45,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {141#true} assume ~id1~0 >= 0; {141#true} is VALID [2022-02-20 18:56:45,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {141#true} assume 0 == ~st1~0; {141#true} is VALID [2022-02-20 18:56:45,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} assume ~send1~0 == ~id1~0; {141#true} is VALID [2022-02-20 18:56:45,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#true} assume 0 == ~mode1~0 % 256; {141#true} is VALID [2022-02-20 18:56:45,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} assume ~id2~0 >= 0; {141#true} is VALID [2022-02-20 18:56:45,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#true} assume 0 == ~st2~0; {141#true} is VALID [2022-02-20 18:56:45,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#true} assume ~send2~0 == ~id2~0; {141#true} is VALID [2022-02-20 18:56:45,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#true} assume 0 == ~mode2~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28296~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28296~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0); {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {143#(= (+ (* (- 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; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {143#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:56:45,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {143#(= (+ (* (- 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; {142#false} is VALID [2022-02-20 18:56:45,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {142#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:56:45,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {142#false} ~mode2~0 := 0; {142#false} is VALID [2022-02-20 18:56:45,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {142#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,706 INFO L290 TraceCheckUtils]: 63: Hoare triple {142#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {142#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:56:45,706 INFO L290 TraceCheckUtils]: 65: Hoare triple {142#false} ~mode3~0 := 0; {142#false} is VALID [2022-02-20 18:56:45,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {142#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,707 INFO L290 TraceCheckUtils]: 67: Hoare triple {142#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,707 INFO L290 TraceCheckUtils]: 68: Hoare triple {142#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:56:45,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {142#false} ~mode4~0 := 0; {142#false} is VALID [2022-02-20 18:56:45,707 INFO L290 TraceCheckUtils]: 70: Hoare triple {142#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,708 INFO L290 TraceCheckUtils]: 71: Hoare triple {142#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,708 INFO L290 TraceCheckUtils]: 72: Hoare triple {142#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:56:45,708 INFO L290 TraceCheckUtils]: 73: Hoare triple {142#false} ~mode5~0 := 0; {142#false} is VALID [2022-02-20 18:56:45,708 INFO L290 TraceCheckUtils]: 74: Hoare triple {142#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,708 INFO L290 TraceCheckUtils]: 75: Hoare triple {142#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,709 INFO L290 TraceCheckUtils]: 76: Hoare triple {142#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:56:45,709 INFO L290 TraceCheckUtils]: 77: Hoare triple {142#false} ~mode6~0 := 0; {142#false} is VALID [2022-02-20 18:56:45,709 INFO L290 TraceCheckUtils]: 78: Hoare triple {142#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,709 INFO L290 TraceCheckUtils]: 79: Hoare triple {142#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {142#false} is VALID [2022-02-20 18:56:45,709 INFO L290 TraceCheckUtils]: 80: Hoare triple {142#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {142#false} is VALID [2022-02-20 18:56:45,710 INFO L290 TraceCheckUtils]: 81: Hoare triple {142#false} ~mode7~0 := 0; {142#false} is VALID [2022-02-20 18:56:45,710 INFO L290 TraceCheckUtils]: 82: Hoare triple {142#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {142#false} is VALID [2022-02-20 18:56:45,710 INFO L290 TraceCheckUtils]: 83: Hoare triple {142#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {142#false} is VALID [2022-02-20 18:56:45,710 INFO L290 TraceCheckUtils]: 84: Hoare triple {142#false} ~__return_28448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28448~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; {142#false} is VALID [2022-02-20 18:56:45,710 INFO L290 TraceCheckUtils]: 85: Hoare triple {142#false} assume 0 == main_~assert__arg~0#1 % 256; {142#false} is VALID [2022-02-20 18:56:45,711 INFO L290 TraceCheckUtils]: 86: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-02-20 18:56:45,712 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:56:45,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:45,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589110518] [2022-02-20 18:56:45,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589110518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:45,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:45,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:45,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406523143] [2022-02-20 18:56:45,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:45,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 18:56:45,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:45,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:45,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:45,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:45,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:45,801 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:46,103 INFO L93 Difference]: Finished difference Result 300 states and 490 transitions. [2022-02-20 18:56:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:46,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-02-20 18:56:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:56:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:56:46,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions. [2022-02-20 18:56:46,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:46,489 INFO L225 Difference]: With dead ends: 300 [2022-02-20 18:56:46,489 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 18:56:46,492 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:56:46,494 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 159 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 471 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:56:46,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 471 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 18:56:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-02-20 18:56:46,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:46,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,525 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,526 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:46,541 INFO L93 Difference]: Finished difference Result 209 states and 299 transitions. [2022-02-20 18:56:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 299 transitions. [2022-02-20 18:56:46,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:46,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:46,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 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 209 states. [2022-02-20 18:56:46,544 INFO L87 Difference]: Start difference. First operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 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 209 states. [2022-02-20 18:56:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:46,550 INFO L93 Difference]: Finished difference Result 209 states and 299 transitions. [2022-02-20 18:56:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 299 transitions. [2022-02-20 18:56:46,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:46,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:46,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:46,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.4466019417475728) internal successors, (298), 206 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions. [2022-02-20 18:56:46,559 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 87 [2022-02-20 18:56:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:46,559 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 298 transitions. [2022-02-20 18:56:46,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2022-02-20 18:56:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 18:56:46,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:46,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:46,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:56:46,562 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1559740613, now seen corresponding path program 1 times [2022-02-20 18:56:46,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:46,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685945179] [2022-02-20 18:56:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:46,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:46,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {1228#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28296~0 := 0;~__return_28448~0 := 0; {1228#true} is VALID [2022-02-20 18:56:46,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {1228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {1228#true} is VALID [2022-02-20 18:56:46,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {1228#true} assume 0 == ~r1~0 % 256; {1228#true} is VALID [2022-02-20 18:56:46,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {1228#true} assume ~id1~0 >= 0; {1228#true} is VALID [2022-02-20 18:56:46,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {1228#true} assume 0 == ~st1~0; {1228#true} is VALID [2022-02-20 18:56:46,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {1228#true} assume ~send1~0 == ~id1~0; {1228#true} is VALID [2022-02-20 18:56:46,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {1228#true} assume 0 == ~mode1~0 % 256; {1228#true} is VALID [2022-02-20 18:56:46,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {1228#true} assume ~id2~0 >= 0; {1228#true} is VALID [2022-02-20 18:56:46,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {1228#true} assume 0 == ~st2~0; {1228#true} is VALID [2022-02-20 18:56:46,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {1228#true} assume ~send2~0 == ~id2~0; {1228#true} is VALID [2022-02-20 18:56:46,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {1228#true} assume 0 == ~mode2~0 % 256; {1228#true} is VALID [2022-02-20 18:56:46,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {1228#true} assume ~id3~0 >= 0; {1228#true} is VALID [2022-02-20 18:56:46,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {1228#true} assume 0 == ~st3~0; {1228#true} is VALID [2022-02-20 18:56:46,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {1228#true} assume ~send3~0 == ~id3~0; {1228#true} is VALID [2022-02-20 18:56:46,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#true} assume 0 == ~mode3~0 % 256; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28296~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28296~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0); {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {1230#(= (+ (* (- 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; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,679 INFO L290 TraceCheckUtils]: 61: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {1230#(= (+ (* (- 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; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1230#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:56:46,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {1230#(= (+ (* (- 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; {1229#false} is VALID [2022-02-20 18:56:46,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {1229#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1229#false} is VALID [2022-02-20 18:56:46,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {1229#false} ~mode3~0 := 0; {1229#false} is VALID [2022-02-20 18:56:46,681 INFO L290 TraceCheckUtils]: 67: Hoare triple {1229#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {1229#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {1229#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1229#false} is VALID [2022-02-20 18:56:46,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {1229#false} ~mode4~0 := 0; {1229#false} is VALID [2022-02-20 18:56:46,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {1229#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {1229#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {1229#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1229#false} is VALID [2022-02-20 18:56:46,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {1229#false} ~mode5~0 := 0; {1229#false} is VALID [2022-02-20 18:56:46,683 INFO L290 TraceCheckUtils]: 75: Hoare triple {1229#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,683 INFO L290 TraceCheckUtils]: 76: Hoare triple {1229#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {1229#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {1229#false} is VALID [2022-02-20 18:56:46,683 INFO L290 TraceCheckUtils]: 78: Hoare triple {1229#false} ~mode6~0 := 0; {1229#false} is VALID [2022-02-20 18:56:46,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {1229#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,684 INFO L290 TraceCheckUtils]: 80: Hoare triple {1229#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1229#false} is VALID [2022-02-20 18:56:46,684 INFO L290 TraceCheckUtils]: 81: Hoare triple {1229#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {1229#false} is VALID [2022-02-20 18:56:46,684 INFO L290 TraceCheckUtils]: 82: Hoare triple {1229#false} ~mode7~0 := 0; {1229#false} is VALID [2022-02-20 18:56:46,684 INFO L290 TraceCheckUtils]: 83: Hoare triple {1229#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1229#false} is VALID [2022-02-20 18:56:46,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {1229#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {1229#false} is VALID [2022-02-20 18:56:46,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {1229#false} ~__return_28448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28448~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; {1229#false} is VALID [2022-02-20 18:56:46,685 INFO L290 TraceCheckUtils]: 86: Hoare triple {1229#false} assume 0 == main_~assert__arg~0#1 % 256; {1229#false} is VALID [2022-02-20 18:56:46,685 INFO L290 TraceCheckUtils]: 87: Hoare triple {1229#false} assume !false; {1229#false} is VALID [2022-02-20 18:56:46,685 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:56:46,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:46,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685945179] [2022-02-20 18:56:46,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685945179] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:46,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:46,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:46,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586117719] [2022-02-20 18:56:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:46,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2022-02-20 18:56:46,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:46,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:46,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:46,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:46,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:46,754 INFO L87 Difference]: Start difference. First operand 207 states and 298 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:46,997 INFO L93 Difference]: Finished difference Result 499 states and 762 transitions. [2022-02-20 18:56:46,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:46,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2022-02-20 18:56:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:47,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:56:47,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:47,312 INFO L225 Difference]: With dead ends: 499 [2022-02-20 18:56:47,312 INFO L226 Difference]: Without dead ends: 345 [2022-02-20 18:56:47,313 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:56:47,314 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 110 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 402 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:56:47,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 402 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-02-20 18:56:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2022-02-20 18:56:47,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:47,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,331 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,332 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:47,343 INFO L93 Difference]: Finished difference Result 345 states and 515 transitions. [2022-02-20 18:56:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 515 transitions. [2022-02-20 18:56:47,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:47,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:47,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 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 345 states. [2022-02-20 18:56:47,345 INFO L87 Difference]: Start difference. First operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 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 345 states. [2022-02-20 18:56:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:47,355 INFO L93 Difference]: Finished difference Result 345 states and 515 transitions. [2022-02-20 18:56:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 515 transitions. [2022-02-20 18:56:47,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:47,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:47,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:47,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5029239766081872) internal successors, (514), 342 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 514 transitions. [2022-02-20 18:56:47,366 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 514 transitions. Word has length 88 [2022-02-20 18:56:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:47,366 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 514 transitions. [2022-02-20 18:56:47,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 514 transitions. [2022-02-20 18:56:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 18:56:47,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:47,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:47,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:56:47,368 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1480148747, now seen corresponding path program 1 times [2022-02-20 18:56:47,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:47,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147818721] [2022-02-20 18:56:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:47,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {3058#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28296~0 := 0;~__return_28448~0 := 0; {3058#true} is VALID [2022-02-20 18:56:47,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3058#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {3058#true} is VALID [2022-02-20 18:56:47,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {3058#true} assume 0 == ~r1~0 % 256; {3058#true} is VALID [2022-02-20 18:56:47,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {3058#true} assume ~id1~0 >= 0; {3058#true} is VALID [2022-02-20 18:56:47,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {3058#true} assume 0 == ~st1~0; {3058#true} is VALID [2022-02-20 18:56:47,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {3058#true} assume ~send1~0 == ~id1~0; {3058#true} is VALID [2022-02-20 18:56:47,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {3058#true} assume 0 == ~mode1~0 % 256; {3058#true} is VALID [2022-02-20 18:56:47,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {3058#true} assume ~id2~0 >= 0; {3058#true} is VALID [2022-02-20 18:56:47,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {3058#true} assume 0 == ~st2~0; {3058#true} is VALID [2022-02-20 18:56:47,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {3058#true} assume ~send2~0 == ~id2~0; {3058#true} is VALID [2022-02-20 18:56:47,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {3058#true} assume 0 == ~mode2~0 % 256; {3058#true} is VALID [2022-02-20 18:56:47,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {3058#true} assume ~id3~0 >= 0; {3058#true} is VALID [2022-02-20 18:56:47,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {3058#true} assume 0 == ~st3~0; {3058#true} is VALID [2022-02-20 18:56:47,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {3058#true} assume ~send3~0 == ~id3~0; {3058#true} is VALID [2022-02-20 18:56:47,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {3058#true} assume 0 == ~mode3~0 % 256; {3058#true} is VALID [2022-02-20 18:56:47,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {3058#true} assume ~id4~0 >= 0; {3058#true} is VALID [2022-02-20 18:56:47,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {3058#true} assume 0 == ~st4~0; {3058#true} is VALID [2022-02-20 18:56:47,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {3058#true} assume ~send4~0 == ~id4~0; {3058#true} is VALID [2022-02-20 18:56:47,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {3058#true} assume 0 == ~mode4~0 % 256; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,462 INFO L290 TraceCheckUtils]: 47: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,462 INFO L290 TraceCheckUtils]: 48: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28296~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28296~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0); {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {3060#(= (+ (* (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; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,480 INFO L290 TraceCheckUtils]: 59: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,480 INFO L290 TraceCheckUtils]: 60: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0); {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,481 INFO L290 TraceCheckUtils]: 61: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,481 INFO L290 TraceCheckUtils]: 62: Hoare triple {3060#(= (+ (* (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; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,481 INFO L290 TraceCheckUtils]: 63: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,482 INFO L290 TraceCheckUtils]: 64: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,483 INFO L290 TraceCheckUtils]: 67: Hoare triple {3060#(= (+ (* (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; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3060#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:56:47,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {3060#(= (+ (* (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; {3059#false} is VALID [2022-02-20 18:56:47,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {3059#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3059#false} is VALID [2022-02-20 18:56:47,484 INFO L290 TraceCheckUtils]: 71: Hoare triple {3059#false} ~mode4~0 := 0; {3059#false} is VALID [2022-02-20 18:56:47,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {3059#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3059#false} is VALID [2022-02-20 18:56:47,485 INFO L290 TraceCheckUtils]: 73: Hoare triple {3059#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3059#false} is VALID [2022-02-20 18:56:47,485 INFO L290 TraceCheckUtils]: 74: Hoare triple {3059#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {3059#false} is VALID [2022-02-20 18:56:47,485 INFO L290 TraceCheckUtils]: 75: Hoare triple {3059#false} ~mode5~0 := 0; {3059#false} is VALID [2022-02-20 18:56:47,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {3059#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {3059#false} is VALID [2022-02-20 18:56:47,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {3059#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3059#false} is VALID [2022-02-20 18:56:47,486 INFO L290 TraceCheckUtils]: 78: Hoare triple {3059#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {3059#false} is VALID [2022-02-20 18:56:47,486 INFO L290 TraceCheckUtils]: 79: Hoare triple {3059#false} ~mode6~0 := 0; {3059#false} is VALID [2022-02-20 18:56:47,486 INFO L290 TraceCheckUtils]: 80: Hoare triple {3059#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {3059#false} is VALID [2022-02-20 18:56:47,486 INFO L290 TraceCheckUtils]: 81: Hoare triple {3059#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {3059#false} is VALID [2022-02-20 18:56:47,486 INFO L290 TraceCheckUtils]: 82: Hoare triple {3059#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {3059#false} is VALID [2022-02-20 18:56:47,486 INFO L290 TraceCheckUtils]: 83: Hoare triple {3059#false} ~mode7~0 := 0; {3059#false} is VALID [2022-02-20 18:56:47,487 INFO L290 TraceCheckUtils]: 84: Hoare triple {3059#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3059#false} is VALID [2022-02-20 18:56:47,487 INFO L290 TraceCheckUtils]: 85: Hoare triple {3059#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {3059#false} is VALID [2022-02-20 18:56:47,487 INFO L290 TraceCheckUtils]: 86: Hoare triple {3059#false} ~__return_28448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28448~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; {3059#false} is VALID [2022-02-20 18:56:47,487 INFO L290 TraceCheckUtils]: 87: Hoare triple {3059#false} assume 0 == main_~assert__arg~0#1 % 256; {3059#false} is VALID [2022-02-20 18:56:47,487 INFO L290 TraceCheckUtils]: 88: Hoare triple {3059#false} assume !false; {3059#false} is VALID [2022-02-20 18:56:47,488 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:56:47,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:47,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147818721] [2022-02-20 18:56:47,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147818721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:47,489 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:47,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:47,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313944573] [2022-02-20 18:56:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-02-20 18:56:47,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:47,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:47,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:47,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:47,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:47,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:47,554 INFO L87 Difference]: Start difference. First operand 343 states and 514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:47,832 INFO L93 Difference]: Finished difference Result 891 states and 1384 transitions. [2022-02-20 18:56:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:47,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-02-20 18:56:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:47,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:56:48,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:48,126 INFO L225 Difference]: With dead ends: 891 [2022-02-20 18:56:48,127 INFO L226 Difference]: Without dead ends: 601 [2022-02-20 18:56:48,128 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:56:48,128 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 105 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 398 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:56:48,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 398 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-02-20 18:56:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2022-02-20 18:56:48,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:48,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 601 states. Second operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,159 INFO L74 IsIncluded]: Start isIncluded. First operand 601 states. Second operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,160 INFO L87 Difference]: Start difference. First operand 601 states. Second operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:48,176 INFO L93 Difference]: Finished difference Result 601 states and 919 transitions. [2022-02-20 18:56:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 919 transitions. [2022-02-20 18:56:48,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:48,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:48,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 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 601 states. [2022-02-20 18:56:48,179 INFO L87 Difference]: Start difference. First operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 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 601 states. [2022-02-20 18:56:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:48,193 INFO L93 Difference]: Finished difference Result 601 states and 919 transitions. [2022-02-20 18:56:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 919 transitions. [2022-02-20 18:56:48,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:48,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:48,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:48,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 598 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 918 transitions. [2022-02-20 18:56:48,214 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 918 transitions. Word has length 89 [2022-02-20 18:56:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:48,214 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 918 transitions. [2022-02-20 18:56:48,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 918 transitions. [2022-02-20 18:56:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 18:56:48,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:48,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:48,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:56:48,216 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1142089047, now seen corresponding path program 1 times [2022-02-20 18:56:48,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:48,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102354344] [2022-02-20 18:56:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:48,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {6311#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28296~0 := 0;~__return_28448~0 := 0; {6311#true} is VALID [2022-02-20 18:56:48,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {6311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {6311#true} is VALID [2022-02-20 18:56:48,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {6311#true} assume 0 == ~r1~0 % 256; {6311#true} is VALID [2022-02-20 18:56:48,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {6311#true} assume ~id1~0 >= 0; {6311#true} is VALID [2022-02-20 18:56:48,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {6311#true} assume 0 == ~st1~0; {6311#true} is VALID [2022-02-20 18:56:48,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {6311#true} assume ~send1~0 == ~id1~0; {6311#true} is VALID [2022-02-20 18:56:48,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {6311#true} assume 0 == ~mode1~0 % 256; {6311#true} is VALID [2022-02-20 18:56:48,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {6311#true} assume ~id2~0 >= 0; {6311#true} is VALID [2022-02-20 18:56:48,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {6311#true} assume 0 == ~st2~0; {6311#true} is VALID [2022-02-20 18:56:48,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {6311#true} assume ~send2~0 == ~id2~0; {6311#true} is VALID [2022-02-20 18:56:48,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {6311#true} assume 0 == ~mode2~0 % 256; {6311#true} is VALID [2022-02-20 18:56:48,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {6311#true} assume ~id3~0 >= 0; {6311#true} is VALID [2022-02-20 18:56:48,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {6311#true} assume 0 == ~st3~0; {6311#true} is VALID [2022-02-20 18:56:48,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {6311#true} assume ~send3~0 == ~id3~0; {6311#true} is VALID [2022-02-20 18:56:48,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {6311#true} assume 0 == ~mode3~0 % 256; {6311#true} is VALID [2022-02-20 18:56:48,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {6311#true} assume ~id4~0 >= 0; {6311#true} is VALID [2022-02-20 18:56:48,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {6311#true} assume 0 == ~st4~0; {6311#true} is VALID [2022-02-20 18:56:48,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {6311#true} assume ~send4~0 == ~id4~0; {6311#true} is VALID [2022-02-20 18:56:48,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {6311#true} assume 0 == ~mode4~0 % 256; {6311#true} is VALID [2022-02-20 18:56:48,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {6311#true} assume ~id5~0 >= 0; {6311#true} is VALID [2022-02-20 18:56:48,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {6311#true} assume 0 == ~st5~0; {6311#true} is VALID [2022-02-20 18:56:48,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {6311#true} assume ~send5~0 == ~id5~0; {6311#true} is VALID [2022-02-20 18:56:48,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {6311#true} assume 0 == ~mode5~0 % 256; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28296~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28296~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0); {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {6313#(= (+ (* (- 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; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0); {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {6313#(= (+ (* (- 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; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {6313#(= (+ (* (- 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; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~nomsg~0); {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {6313#(= (+ (* (- 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; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6313#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:56:48,317 INFO L290 TraceCheckUtils]: 74: Hoare triple {6313#(= (+ (* (- 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; {6312#false} is VALID [2022-02-20 18:56:48,317 INFO L290 TraceCheckUtils]: 75: Hoare triple {6312#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {6312#false} is VALID [2022-02-20 18:56:48,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {6312#false} ~mode5~0 := 0; {6312#false} is VALID [2022-02-20 18:56:48,318 INFO L290 TraceCheckUtils]: 77: Hoare triple {6312#false} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {6312#false} is VALID [2022-02-20 18:56:48,318 INFO L290 TraceCheckUtils]: 78: Hoare triple {6312#false} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {6312#false} is VALID [2022-02-20 18:56:48,318 INFO L290 TraceCheckUtils]: 79: Hoare triple {6312#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {6312#false} is VALID [2022-02-20 18:56:48,318 INFO L290 TraceCheckUtils]: 80: Hoare triple {6312#false} ~mode6~0 := 0; {6312#false} is VALID [2022-02-20 18:56:48,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {6312#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {6312#false} is VALID [2022-02-20 18:56:48,319 INFO L290 TraceCheckUtils]: 82: Hoare triple {6312#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {6312#false} is VALID [2022-02-20 18:56:48,319 INFO L290 TraceCheckUtils]: 83: Hoare triple {6312#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {6312#false} is VALID [2022-02-20 18:56:48,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {6312#false} ~mode7~0 := 0; {6312#false} is VALID [2022-02-20 18:56:48,319 INFO L290 TraceCheckUtils]: 85: Hoare triple {6312#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6312#false} is VALID [2022-02-20 18:56:48,319 INFO L290 TraceCheckUtils]: 86: Hoare triple {6312#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {6312#false} is VALID [2022-02-20 18:56:48,319 INFO L290 TraceCheckUtils]: 87: Hoare triple {6312#false} ~__return_28448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28448~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; {6312#false} is VALID [2022-02-20 18:56:48,319 INFO L290 TraceCheckUtils]: 88: Hoare triple {6312#false} assume 0 == main_~assert__arg~0#1 % 256; {6312#false} is VALID [2022-02-20 18:56:48,320 INFO L290 TraceCheckUtils]: 89: Hoare triple {6312#false} assume !false; {6312#false} is VALID [2022-02-20 18:56:48,320 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:56:48,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:48,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102354344] [2022-02-20 18:56:48,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102354344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:48,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:48,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:48,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539536331] [2022-02-20 18:56:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:48,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:56:48,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:48,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:48,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:48,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:48,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:48,376 INFO L87 Difference]: Start difference. First operand 599 states and 918 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:48,714 INFO L93 Difference]: Finished difference Result 1627 states and 2544 transitions. [2022-02-20 18:56:48,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:48,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2022-02-20 18:56:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:48,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:56:48,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:49,030 INFO L225 Difference]: With dead ends: 1627 [2022-02-20 18:56:49,031 INFO L226 Difference]: Without dead ends: 1081 [2022-02-20 18:56:49,032 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:56:49,042 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 394 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:56:49,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 394 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-02-20 18:56:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2022-02-20 18:56:49,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:49,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1081 states. Second operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:49,087 INFO L74 IsIncluded]: Start isIncluded. First operand 1081 states. Second operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:49,089 INFO L87 Difference]: Start difference. First operand 1081 states. Second operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:49,127 INFO L93 Difference]: Finished difference Result 1081 states and 1671 transitions. [2022-02-20 18:56:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1671 transitions. [2022-02-20 18:56:49,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:49,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:49,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 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 1081 states. [2022-02-20 18:56:49,135 INFO L87 Difference]: Start difference. First operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 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 1081 states. [2022-02-20 18:56:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:49,197 INFO L93 Difference]: Finished difference Result 1081 states and 1671 transitions. [2022-02-20 18:56:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1671 transitions. [2022-02-20 18:56:49,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:49,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:49,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:49,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.549165120593692) internal successors, (1670), 1078 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1670 transitions. [2022-02-20 18:56:49,257 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1670 transitions. Word has length 90 [2022-02-20 18:56:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:49,257 INFO L470 AbstractCegarLoop]: Abstraction has 1079 states and 1670 transitions. [2022-02-20 18:56:49,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1670 transitions. [2022-02-20 18:56:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 18:56:49,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:49,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:49,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:56:49,263 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1309607801, now seen corresponding path program 1 times [2022-02-20 18:56:49,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:49,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488137698] [2022-02-20 18:56:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:49,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {12236#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28296~0 := 0;~__return_28448~0 := 0; {12236#true} is VALID [2022-02-20 18:56:49,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {12236#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {12236#true} is VALID [2022-02-20 18:56:49,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {12236#true} assume 0 == ~r1~0 % 256; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {12236#true} assume ~id1~0 >= 0; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {12236#true} assume 0 == ~st1~0; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {12236#true} assume ~send1~0 == ~id1~0; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {12236#true} assume 0 == ~mode1~0 % 256; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {12236#true} assume ~id2~0 >= 0; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {12236#true} assume 0 == ~st2~0; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {12236#true} assume ~send2~0 == ~id2~0; {12236#true} is VALID [2022-02-20 18:56:49,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {12236#true} assume 0 == ~mode2~0 % 256; {12236#true} is VALID [2022-02-20 18:56:49,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {12236#true} assume ~id3~0 >= 0; {12236#true} is VALID [2022-02-20 18:56:49,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {12236#true} assume 0 == ~st3~0; {12236#true} is VALID [2022-02-20 18:56:49,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {12236#true} assume ~send3~0 == ~id3~0; {12236#true} is VALID [2022-02-20 18:56:49,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {12236#true} assume 0 == ~mode3~0 % 256; {12236#true} is VALID [2022-02-20 18:56:49,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {12236#true} assume ~id4~0 >= 0; {12236#true} is VALID [2022-02-20 18:56:49,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {12236#true} assume 0 == ~st4~0; {12236#true} is VALID [2022-02-20 18:56:49,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {12236#true} assume ~send4~0 == ~id4~0; {12236#true} is VALID [2022-02-20 18:56:49,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {12236#true} assume 0 == ~mode4~0 % 256; {12236#true} is VALID [2022-02-20 18:56:49,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {12236#true} assume ~id5~0 >= 0; {12236#true} is VALID [2022-02-20 18:56:49,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {12236#true} assume 0 == ~st5~0; {12236#true} is VALID [2022-02-20 18:56:49,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {12236#true} assume ~send5~0 == ~id5~0; {12236#true} is VALID [2022-02-20 18:56:49,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {12236#true} assume 0 == ~mode5~0 % 256; {12236#true} is VALID [2022-02-20 18:56:49,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {12236#true} assume ~id6~0 >= 0; {12236#true} is VALID [2022-02-20 18:56:49,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {12236#true} assume 0 == ~st6~0; {12236#true} is VALID [2022-02-20 18:56:49,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {12236#true} assume ~send6~0 == ~id6~0; {12236#true} is VALID [2022-02-20 18:56:49,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {12236#true} assume 0 == ~mode6~0 % 256; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28296~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28296~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~nomsg~0); {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~nomsg~0); {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,398 INFO L290 TraceCheckUtils]: 64: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,398 INFO L290 TraceCheckUtils]: 66: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,399 INFO L290 TraceCheckUtils]: 69: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send4~0 != ~nomsg~0); {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,405 INFO L290 TraceCheckUtils]: 78: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:56:49,406 INFO L290 TraceCheckUtils]: 79: Hoare triple {12238#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == ~mode6~0 % 256);main_~node6__m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12237#false} is VALID [2022-02-20 18:56:49,406 INFO L290 TraceCheckUtils]: 80: Hoare triple {12237#false} assume !(main_~node6__m6~0#1 != ~nomsg~0); {12237#false} is VALID [2022-02-20 18:56:49,406 INFO L290 TraceCheckUtils]: 81: Hoare triple {12237#false} ~mode6~0 := 0; {12237#false} is VALID [2022-02-20 18:56:49,406 INFO L290 TraceCheckUtils]: 82: Hoare triple {12237#false} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {12237#false} is VALID [2022-02-20 18:56:49,406 INFO L290 TraceCheckUtils]: 83: Hoare triple {12237#false} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {12237#false} is VALID [2022-02-20 18:56:49,406 INFO L290 TraceCheckUtils]: 84: Hoare triple {12237#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {12237#false} is VALID [2022-02-20 18:56:49,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {12237#false} ~mode7~0 := 0; {12237#false} is VALID [2022-02-20 18:56:49,407 INFO L290 TraceCheckUtils]: 86: Hoare triple {12237#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {12237#false} is VALID [2022-02-20 18:56:49,407 INFO L290 TraceCheckUtils]: 87: Hoare triple {12237#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {12237#false} is VALID [2022-02-20 18:56:49,407 INFO L290 TraceCheckUtils]: 88: Hoare triple {12237#false} ~__return_28448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28448~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; {12237#false} is VALID [2022-02-20 18:56:49,407 INFO L290 TraceCheckUtils]: 89: Hoare triple {12237#false} assume 0 == main_~assert__arg~0#1 % 256; {12237#false} is VALID [2022-02-20 18:56:49,407 INFO L290 TraceCheckUtils]: 90: Hoare triple {12237#false} assume !false; {12237#false} is VALID [2022-02-20 18:56:49,410 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:56:49,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:49,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488137698] [2022-02-20 18:56:49,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488137698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:49,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:49,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:49,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719248338] [2022-02-20 18:56:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 18:56:49,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:49,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:49,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:49,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:49,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:49,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:49,479 INFO L87 Difference]: Start difference. First operand 1079 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:50,122 INFO L93 Difference]: Finished difference Result 3003 states and 4696 transitions. [2022-02-20 18:56:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:50,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-02-20 18:56:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:50,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:56:50,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:50,536 INFO L225 Difference]: With dead ends: 3003 [2022-02-20 18:56:50,536 INFO L226 Difference]: Without dead ends: 1977 [2022-02-20 18:56:50,538 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:56:50,538 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 390 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:56:50,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 390 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-02-20 18:56:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1975. [2022-02-20 18:56:50,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:50,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1977 states. Second operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,621 INFO L74 IsIncluded]: Start isIncluded. First operand 1977 states. Second operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,624 INFO L87 Difference]: Start difference. First operand 1977 states. Second operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:50,743 INFO L93 Difference]: Finished difference Result 1977 states and 3063 transitions. [2022-02-20 18:56:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 3063 transitions. [2022-02-20 18:56:50,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:50,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:50,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 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 1977 states. [2022-02-20 18:56:50,753 INFO L87 Difference]: Start difference. First operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 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 1977 states. [2022-02-20 18:56:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:50,873 INFO L93 Difference]: Finished difference Result 1977 states and 3063 transitions. [2022-02-20 18:56:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 3063 transitions. [2022-02-20 18:56:50,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:50,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:50,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:50,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.5511651469098278) internal successors, (3062), 1974 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3062 transitions. [2022-02-20 18:56:51,044 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3062 transitions. Word has length 91 [2022-02-20 18:56:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:51,045 INFO L470 AbstractCegarLoop]: Abstraction has 1975 states and 3062 transitions. [2022-02-20 18:56:51,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3062 transitions. [2022-02-20 18:56:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 18:56:51,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:51,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:51,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:56:51,047 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash 582949359, now seen corresponding path program 1 times [2022-02-20 18:56:51,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:51,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922954903] [2022-02-20 18:56:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:51,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {23157#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28296~0 := 0;~__return_28448~0 := 0; {23157#true} is VALID [2022-02-20 18:56:51,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {23157#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {23157#true} is VALID [2022-02-20 18:56:51,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {23157#true} assume 0 == ~r1~0 % 256; {23157#true} is VALID [2022-02-20 18:56:51,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {23157#true} assume ~id1~0 >= 0; {23157#true} is VALID [2022-02-20 18:56:51,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {23157#true} assume 0 == ~st1~0; {23157#true} is VALID [2022-02-20 18:56:51,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {23157#true} assume ~send1~0 == ~id1~0; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {23157#true} assume 0 == ~mode1~0 % 256; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {23157#true} assume ~id2~0 >= 0; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {23157#true} assume 0 == ~st2~0; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {23157#true} assume ~send2~0 == ~id2~0; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {23157#true} assume 0 == ~mode2~0 % 256; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {23157#true} assume ~id3~0 >= 0; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {23157#true} assume 0 == ~st3~0; {23157#true} is VALID [2022-02-20 18:56:51,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {23157#true} assume ~send3~0 == ~id3~0; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {23157#true} assume 0 == ~mode3~0 % 256; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {23157#true} assume ~id4~0 >= 0; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {23157#true} assume 0 == ~st4~0; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {23157#true} assume ~send4~0 == ~id4~0; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {23157#true} assume 0 == ~mode4~0 % 256; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {23157#true} assume ~id5~0 >= 0; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {23157#true} assume 0 == ~st5~0; {23157#true} is VALID [2022-02-20 18:56:51,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {23157#true} assume ~send5~0 == ~id5~0; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {23157#true} assume 0 == ~mode5~0 % 256; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {23157#true} assume ~id6~0 >= 0; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {23157#true} assume 0 == ~st6~0; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {23157#true} assume ~send6~0 == ~id6~0; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {23157#true} assume 0 == ~mode6~0 % 256; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {23157#true} assume ~id7~0 >= 0; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {23157#true} assume 0 == ~st7~0; {23157#true} is VALID [2022-02-20 18:56:51,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {23157#true} assume ~send7~0 == ~id7~0; {23157#true} is VALID [2022-02-20 18:56:51,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {23157#true} assume 0 == ~mode7~0 % 256; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28296~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28296~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send1~0 != ~nomsg~0); {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send2~0 != ~nomsg~0); {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,141 INFO L290 TraceCheckUtils]: 64: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,141 INFO L290 TraceCheckUtils]: 66: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send4~0 != ~nomsg~0); {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,144 INFO L290 TraceCheckUtils]: 72: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,144 INFO L290 TraceCheckUtils]: 73: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,145 INFO L290 TraceCheckUtils]: 76: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,146 INFO L290 TraceCheckUtils]: 77: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,146 INFO L290 TraceCheckUtils]: 78: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,147 INFO L290 TraceCheckUtils]: 79: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(~send6~0 != ~nomsg~0); {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,148 INFO L290 TraceCheckUtils]: 82: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256);~mode6~0 := 1; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,148 INFO L290 TraceCheckUtils]: 83: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {23159#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == ~mode7~0 % 256);main_~node7__m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {23158#false} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 85: Hoare triple {23158#false} assume !(main_~node7__m7~0#1 != ~nomsg~0); {23158#false} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 86: Hoare triple {23158#false} ~mode7~0 := 0; {23158#false} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 87: Hoare triple {23158#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {23158#false} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 88: Hoare triple {23158#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {23158#false} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 89: Hoare triple {23158#false} ~__return_28448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28448~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; {23158#false} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 90: Hoare triple {23158#false} assume 0 == main_~assert__arg~0#1 % 256; {23158#false} is VALID [2022-02-20 18:56:51,149 INFO L290 TraceCheckUtils]: 91: Hoare triple {23158#false} assume !false; {23158#false} is VALID [2022-02-20 18:56:51,150 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:56:51,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:51,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922954903] [2022-02-20 18:56:51,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922954903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:51,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:51,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:56:51,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611791606] [2022-02-20 18:56:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:56:51,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:51,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:51,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:51,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:56:51,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:51,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:56:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:56:51,206 INFO L87 Difference]: Start difference. First operand 1975 states and 3062 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:53,379 INFO L93 Difference]: Finished difference Result 5563 states and 8664 transitions. [2022-02-20 18:56:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:56:53,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2022-02-20 18:56:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:56:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-02-20 18:56:53,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 430 transitions. [2022-02-20 18:56:53,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:54,341 INFO L225 Difference]: With dead ends: 5563 [2022-02-20 18:56:54,341 INFO L226 Difference]: Without dead ends: 3641 [2022-02-20 18:56:54,356 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:56:54,369 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 386 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:56:54,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 386 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:56:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2022-02-20 18:56:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3639. [2022-02-20 18:56:54,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:56:54,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3641 states. Second operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,549 INFO L74 IsIncluded]: Start isIncluded. First operand 3641 states. Second operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,552 INFO L87 Difference]: Start difference. First operand 3641 states. Second operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:54,939 INFO L93 Difference]: Finished difference Result 3641 states and 5623 transitions. [2022-02-20 18:56:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5623 transitions. [2022-02-20 18:56:54,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:54,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:54,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 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 3641 states. [2022-02-20 18:56:54,952 INFO L87 Difference]: Start difference. First operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 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 3641 states. [2022-02-20 18:56:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:56:55,347 INFO L93 Difference]: Finished difference Result 3641 states and 5623 transitions. [2022-02-20 18:56:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5623 transitions. [2022-02-20 18:56:55,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:56:55,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:56:55,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:56:55,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:56:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3638 states have (on average 1.5453545904343045) internal successors, (5622), 3638 states have internal predecessors, (5622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5622 transitions. [2022-02-20 18:56:55,969 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5622 transitions. Word has length 92 [2022-02-20 18:56:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:56:55,970 INFO L470 AbstractCegarLoop]: Abstraction has 3639 states and 5622 transitions. [2022-02-20 18:56:55,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5622 transitions. [2022-02-20 18:56:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 18:56:55,971 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:56:55,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:56:55,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:56:55,971 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:56:55,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:56:55,972 INFO L85 PathProgramCache]: Analyzing trace with hash -496500112, now seen corresponding path program 1 times [2022-02-20 18:56:55,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:56:55,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825095787] [2022-02-20 18:56:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:56:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:56:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:56:56,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {43374#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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~__return_28296~0 := 0;~__return_28448~0 := 0; {43374#true} is VALID [2022-02-20 18:56:56,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {43374#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node7____CPAchecker_TMP_0~0#1, main_~node7__m7~0#1, main_~node6____CPAchecker_TMP_0~0#1, main_~node6__m6~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id6~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st6~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send6~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode6~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id7~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st7~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send7~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode7~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_~init__tmp~0#1; {43374#true} is VALID [2022-02-20 18:56:56,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {43374#true} assume 0 == ~r1~0 % 256; {43374#true} is VALID [2022-02-20 18:56:56,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {43374#true} assume ~id1~0 >= 0; {43374#true} is VALID [2022-02-20 18:56:56,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {43374#true} assume 0 == ~st1~0; {43376#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:56,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {43376#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {43376#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:56,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {43376#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {43376#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:56,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {43376#(<= ~st1~0 0)} assume ~id2~0 >= 0; {43376#(<= ~st1~0 0)} is VALID [2022-02-20 18:56:56,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {43376#(<= ~st1~0 0)} assume 0 == ~st2~0; {43377#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {43377#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {43377#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {43377#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {43377#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {43377#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {43377#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {43377#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {43378#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {43379#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:56:56,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {43380#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {43381#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0;main_~init__tmp~0#1 := 1;~__return_28296~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_28296~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0); {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send2~0 != ~nomsg~0); {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,105 INFO L290 TraceCheckUtils]: 66: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,106 INFO L290 TraceCheckUtils]: 69: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send4~0 != ~nomsg~0); {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,107 INFO L290 TraceCheckUtils]: 72: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,107 INFO L290 TraceCheckUtils]: 73: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~p5_new~0 == ~nomsg~0;main_~node5____CPAchecker_TMP_0~0#1 := ~send5~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256);~mode5~0 := 1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node6__m6~0#1;main_~node6__m6~0#1 := ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,110 INFO L290 TraceCheckUtils]: 79: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode6~0 % 256);havoc main_~node6____CPAchecker_TMP_0~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send6~0 != ~nomsg~0); {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node6____CPAchecker_TMP_0~0#1 := ~p6_new~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,111 INFO L290 TraceCheckUtils]: 82: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if main_~node6____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node6____CPAchecker_TMP_0~0#1 % 256 else main_~node6____CPAchecker_TMP_0~0#1 % 256 - 256);~mode6~0 := 1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,111 INFO L290 TraceCheckUtils]: 83: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} havoc main_~node7__m7~0#1;main_~node7__m7~0#1 := ~nomsg~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,112 INFO L290 TraceCheckUtils]: 84: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !!(0 == ~mode7~0 % 256);havoc main_~node7____CPAchecker_TMP_0~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,113 INFO L290 TraceCheckUtils]: 85: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~send7~0 != ~nomsg~0); {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,113 INFO L290 TraceCheckUtils]: 86: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main_~node7____CPAchecker_TMP_0~0#1 := ~p7_new~0; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,114 INFO L290 TraceCheckUtils]: 87: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if main_~node7____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node7____CPAchecker_TMP_0~0#1 % 256 else main_~node7____CPAchecker_TMP_0~0#1 % 256 - 256);~mode7~0 := 1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,115 INFO L290 TraceCheckUtils]: 88: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:56:56,116 INFO L290 TraceCheckUtils]: 89: Hoare triple {43382#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);main_~check__tmp~0#1 := 0; {43375#false} is VALID [2022-02-20 18:56:56,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {43375#false} ~__return_28448~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_28448~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; {43375#false} is VALID [2022-02-20 18:56:56,117 INFO L290 TraceCheckUtils]: 91: Hoare triple {43375#false} assume 0 == main_~assert__arg~0#1 % 256; {43375#false} is VALID [2022-02-20 18:56:56,119 INFO L290 TraceCheckUtils]: 92: Hoare triple {43375#false} assume !false; {43375#false} is VALID [2022-02-20 18:56:56,120 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:56:56,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:56:56,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825095787] [2022-02-20 18:56:56,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825095787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:56:56,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:56:56,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:56:56,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379599253] [2022-02-20 18:56:56,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:56:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 18:56:56,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:56:56,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:56:56,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:56:56,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:56:56,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:56:56,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:56:56,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:56:56,195 INFO L87 Difference]: Start difference. First operand 3639 states and 5622 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)