./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.UNBOUNDED.pals.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/pals_lcr.8.1.ufo.UNBOUNDED.pals.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 a3df27f87602fca8935d2269a873dfd3f1a5195383d477434680a0bc703d239a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:30:55,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:30:55,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:30:55,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:30:55,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:30:55,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:30:55,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:30:55,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:30:55,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:30:55,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:30:55,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:30:55,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:30:55,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:30:55,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:30:55,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:30:55,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:30:55,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:30:55,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:30:55,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:30:55,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:30:55,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:30:55,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:30:55,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:30:55,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:30:55,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:30:55,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:30:55,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:30:55,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:30:55,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:30:55,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:30:55,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:30:55,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:30:55,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:30:55,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:30:55,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:30:55,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:30:55,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:30:55,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:30:55,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:30:55,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:30:55,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:30:55,460 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:30:55,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:30:55,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:30:55,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:30:55,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:30:55,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:30:55,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:30:55,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:30:55,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:30:55,500 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:30:55,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:30:55,501 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:30:55,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:30:55,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:30:55,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:30:55,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:30:55,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:30:55,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:30:55,502 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:30:55,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:30:55,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:30:55,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:30:55,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:30:55,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:30:55,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:30:55,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:55,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:30:55,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:30:55,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:30:55,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:30:55,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:30:55,504 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:30:55,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:30:55,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:30:55,504 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 -> a3df27f87602fca8935d2269a873dfd3f1a5195383d477434680a0bc703d239a [2022-02-20 18:30:55,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:30:55,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:30:55,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:30:55,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:30:55,849 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:30:55,850 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:55,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3851f51c/2ccb967cfcc4423393227e2e8923d066/FLAG439d0df12 [2022-02-20 18:30:56,472 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:30:56,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:56,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3851f51c/2ccb967cfcc4423393227e2e8923d066/FLAG439d0df12 [2022-02-20 18:30:56,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3851f51c/2ccb967cfcc4423393227e2e8923d066 [2022-02-20 18:30:56,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:30:56,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:30:56,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:56,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:30:56,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:30:56,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:56" (1/1) ... [2022-02-20 18:30:56,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123522e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:56, skipping insertion in model container [2022-02-20 18:30:56,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:56" (1/1) ... [2022-02-20 18:30:56,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:30:56,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:30:57,162 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/pals_lcr.8.1.ufo.UNBOUNDED.pals.c[26518,26531] [2022-02-20 18:30:57,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:57,174 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:30:57,264 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/pals_lcr.8.1.ufo.UNBOUNDED.pals.c[26518,26531] [2022-02-20 18:30:57,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:57,289 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:30:57,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57 WrapperNode [2022-02-20 18:30:57,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:57,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:57,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:30:57,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:30:57,303 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:30:57" (1/1) ... [2022-02-20 18:30:57,319 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:30:57" (1/1) ... [2022-02-20 18:30:57,357 INFO L137 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 523 [2022-02-20 18:30:57,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:57,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:30:57,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:30:57,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:30:57,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:30:57,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:30:57,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:30:57,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:30:57,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (1/1) ... [2022-02-20 18:30:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:57,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:30:57,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:30:57,454 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:30:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:30:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:30:57,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:30:57,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:30:57,623 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:30:57,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:30:58,249 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:30:58,255 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:30:58,255 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:30:58,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:58 BoogieIcfgContainer [2022-02-20 18:30:58,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:30:58,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:30:58,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:30:58,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:30:58,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:30:56" (1/3) ... [2022-02-20 18:30:58,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c48511d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:58, skipping insertion in model container [2022-02-20 18:30:58,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:57" (2/3) ... [2022-02-20 18:30:58,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c48511d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:58, skipping insertion in model container [2022-02-20 18:30:58,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:58" (3/3) ... [2022-02-20 18:30:58,262 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:58,265 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:30:58,265 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:30:58,291 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:30:58,295 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:30:58,296 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:30:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:30:58,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:58,313 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] [2022-02-20 18:30:58,314 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 118130595, now seen corresponding path program 1 times [2022-02-20 18:30:58,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:58,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902985404] [2022-02-20 18:30:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:58,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {152#true} is VALID [2022-02-20 18:30:58,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {152#true} is VALID [2022-02-20 18:30:58,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {152#true} is VALID [2022-02-20 18:30:58,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} init_#res#1 := init_~tmp~0#1; {152#true} is VALID [2022-02-20 18:30:58,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {152#true} is VALID [2022-02-20 18:30:58,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {153#false} is VALID [2022-02-20 18:30:58,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#false} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {153#false} is VALID [2022-02-20 18:30:58,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {153#false} assume !(0 != ~mode1~0 % 256); {153#false} is VALID [2022-02-20 18:30:58,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {153#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {153#false} is VALID [2022-02-20 18:30:58,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {153#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:30:58,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {153#false} assume !(0 != ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:30:58,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {153#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {153#false} is VALID [2022-02-20 18:30:58,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:30:58,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {153#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {153#false} assume !(0 != ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:30:58,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {153#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {153#false} is VALID [2022-02-20 18:30:58,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {153#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:30:58,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {153#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {153#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {153#false} assume !(node4_~m4~0#1 != ~nomsg~0); {153#false} is VALID [2022-02-20 18:30:58,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {153#false} ~mode4~0 := 0; {153#false} is VALID [2022-02-20 18:30:58,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {153#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {153#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {153#false} assume !(node5_~m5~0#1 != ~nomsg~0); {153#false} is VALID [2022-02-20 18:30:58,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {153#false} ~mode5~0 := 0; {153#false} is VALID [2022-02-20 18:30:58,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {153#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {153#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {153#false} assume !(node6_~m6~0#1 != ~nomsg~0); {153#false} is VALID [2022-02-20 18:30:58,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {153#false} ~mode6~0 := 0; {153#false} is VALID [2022-02-20 18:30:58,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {153#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {153#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {153#false} assume !(node7_~m7~0#1 != ~nomsg~0); {153#false} is VALID [2022-02-20 18:30:58,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {153#false} ~mode7~0 := 0; {153#false} is VALID [2022-02-20 18:30:58,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {153#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {153#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {153#false} is VALID [2022-02-20 18:30:58,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {153#false} assume !(node8_~m8~0#1 != ~nomsg~0); {153#false} is VALID [2022-02-20 18:30:58,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {153#false} ~mode8~0 := 0; {153#false} is VALID [2022-02-20 18:30:58,517 INFO L290 TraceCheckUtils]: 39: Hoare triple {153#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {153#false} is VALID [2022-02-20 18:30:58,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {153#false} is VALID [2022-02-20 18:30:58,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {153#false} check_#res#1 := check_~tmp~1#1; {153#false} is VALID [2022-02-20 18:30:58,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {153#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {153#false} is VALID [2022-02-20 18:30:58,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {153#false} assume 0 == assert_~arg#1 % 256; {153#false} is VALID [2022-02-20 18:30:58,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:30:58,519 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:30:58,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:58,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902985404] [2022-02-20 18:30:58,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902985404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:58,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:58,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:30:58,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111855719] [2022-02-20 18:30:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:58,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:58,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:58,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:30:58,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:30:58,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:58,574 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 148 states have internal predecessors, (259), 0 states have call successors, (0), 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 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:58,685 INFO L93 Difference]: Finished difference Result 228 states and 387 transitions. [2022-02-20 18:30:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:30:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 387 transitions. [2022-02-20 18:30:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 387 transitions. [2022-02-20 18:30:58,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 387 transitions. [2022-02-20 18:30:58,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:58,974 INFO L225 Difference]: With dead ends: 228 [2022-02-20 18:30:58,974 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:30:58,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:58,978 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:58,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:30:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:30:59,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:59,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.75) internal successors, (252), 144 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,002 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.75) internal successors, (252), 144 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,003 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.75) internal successors, (252), 144 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,008 INFO L93 Difference]: Finished difference Result 145 states and 252 transitions. [2022-02-20 18:30:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 252 transitions. [2022-02-20 18:30:59,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:59,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:59,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.75) internal successors, (252), 144 states have internal predecessors, (252), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:30:59,010 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.75) internal successors, (252), 144 states have internal predecessors, (252), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:30:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,014 INFO L93 Difference]: Finished difference Result 145 states and 252 transitions. [2022-02-20 18:30:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 252 transitions. [2022-02-20 18:30:59,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:59,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:59,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:59,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.75) internal successors, (252), 144 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 252 transitions. [2022-02-20 18:30:59,021 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 252 transitions. Word has length 45 [2022-02-20 18:30:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:59,021 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 252 transitions. [2022-02-20 18:30:59,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 252 transitions. [2022-02-20 18:30:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:30:59,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:59,023 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] [2022-02-20 18:30:59,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:30:59,023 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1253676703, now seen corresponding path program 1 times [2022-02-20 18:30:59,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:59,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547856555] [2022-02-20 18:30:59,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:59,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {855#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {855#true} is VALID [2022-02-20 18:30:59,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {855#true} is VALID [2022-02-20 18:30:59,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {857#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:30:59,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {857#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {858#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:30:59,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {858#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {859#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:30:59,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {859#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {856#false} is VALID [2022-02-20 18:30:59,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#false} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {856#false} is VALID [2022-02-20 18:30:59,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {856#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#false} assume !(0 != ~mode1~0 % 256); {856#false} is VALID [2022-02-20 18:30:59,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {856#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {856#false} is VALID [2022-02-20 18:30:59,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {856#false} assume !(0 != ~mode2~0 % 256); {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {856#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {856#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {856#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {856#false} assume !(0 != ~mode3~0 % 256); {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {856#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {856#false} is VALID [2022-02-20 18:30:59,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {856#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {856#false} is VALID [2022-02-20 18:30:59,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {856#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {856#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {856#false} assume !(node4_~m4~0#1 != ~nomsg~0); {856#false} is VALID [2022-02-20 18:30:59,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {856#false} ~mode4~0 := 0; {856#false} is VALID [2022-02-20 18:30:59,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {856#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {856#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {856#false} assume !(node5_~m5~0#1 != ~nomsg~0); {856#false} is VALID [2022-02-20 18:30:59,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {856#false} ~mode5~0 := 0; {856#false} is VALID [2022-02-20 18:30:59,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {856#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {856#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {856#false} assume !(node6_~m6~0#1 != ~nomsg~0); {856#false} is VALID [2022-02-20 18:30:59,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {856#false} ~mode6~0 := 0; {856#false} is VALID [2022-02-20 18:30:59,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {856#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {856#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {856#false} assume !(node7_~m7~0#1 != ~nomsg~0); {856#false} is VALID [2022-02-20 18:30:59,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {856#false} ~mode7~0 := 0; {856#false} is VALID [2022-02-20 18:30:59,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {856#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {856#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {856#false} is VALID [2022-02-20 18:30:59,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {856#false} assume !(node8_~m8~0#1 != ~nomsg~0); {856#false} is VALID [2022-02-20 18:30:59,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {856#false} ~mode8~0 := 0; {856#false} is VALID [2022-02-20 18:30:59,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {856#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {856#false} is VALID [2022-02-20 18:30:59,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {856#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {856#false} is VALID [2022-02-20 18:30:59,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {856#false} check_#res#1 := check_~tmp~1#1; {856#false} is VALID [2022-02-20 18:30:59,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {856#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {856#false} is VALID [2022-02-20 18:30:59,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {856#false} assume 0 == assert_~arg#1 % 256; {856#false} is VALID [2022-02-20 18:30:59,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {856#false} assume !false; {856#false} is VALID [2022-02-20 18:30:59,137 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:30:59,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:59,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547856555] [2022-02-20 18:30:59,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547856555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:59,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:59,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:30:59,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100881599] [2022-02-20 18:30:59,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:59,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:59,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:59,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:30:59,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:30:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:30:59,173 INFO L87 Difference]: Start difference. First operand 145 states and 252 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,565 INFO L93 Difference]: Finished difference Result 227 states and 380 transitions. [2022-02-20 18:30:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:30:59,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-02-20 18:30:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-02-20 18:30:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2022-02-20 18:30:59,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 380 transitions. [2022-02-20 18:30:59,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:59,776 INFO L225 Difference]: With dead ends: 227 [2022-02-20 18:30:59,776 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:30:59,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:59,781 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:59,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 936 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:30:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:30:59,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:59,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,797 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,798 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,801 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2022-02-20 18:30:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2022-02-20 18:30:59,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:59,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:59,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:30:59,802 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:30:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:59,805 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2022-02-20 18:30:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2022-02-20 18:30:59,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:59,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:59,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:59,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2022-02-20 18:30:59,809 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 45 [2022-02-20 18:30:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:59,809 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2022-02-20 18:30:59,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2022-02-20 18:30:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:30:59,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:59,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:30:59,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:30:59,820 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:59,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1781682001, now seen corresponding path program 1 times [2022-02-20 18:30:59,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:59,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490287787] [2022-02-20 18:30:59,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:59,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {1564#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {1564#true} is VALID [2022-02-20 18:30:59,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1564#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1564#true} is VALID [2022-02-20 18:30:59,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {1564#true} assume 0 == ~r1~0 % 256; {1564#true} is VALID [2022-02-20 18:30:59,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {1564#true} assume ~id1~0 >= 0; {1564#true} is VALID [2022-02-20 18:30:59,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {1564#true} assume 0 == ~st1~0; {1564#true} is VALID [2022-02-20 18:30:59,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {1564#true} assume ~send1~0 == ~id1~0; {1564#true} is VALID [2022-02-20 18:30:59,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {1564#true} assume 0 == ~mode1~0 % 256; {1564#true} is VALID [2022-02-20 18:30:59,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {1564#true} assume ~id2~0 >= 0; {1564#true} is VALID [2022-02-20 18:30:59,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {1564#true} assume 0 == ~st2~0; {1564#true} is VALID [2022-02-20 18:30:59,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {1564#true} assume ~send2~0 == ~id2~0; {1564#true} is VALID [2022-02-20 18:30:59,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {1564#true} assume 0 == ~mode2~0 % 256; {1564#true} is VALID [2022-02-20 18:30:59,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {1564#true} assume ~id3~0 >= 0; {1564#true} is VALID [2022-02-20 18:30:59,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {1564#true} assume 0 == ~st3~0; {1564#true} is VALID [2022-02-20 18:30:59,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {1564#true} assume ~send3~0 == ~id3~0; {1564#true} is VALID [2022-02-20 18:30:59,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#true} assume 0 == ~mode3~0 % 256; {1564#true} is VALID [2022-02-20 18:30:59,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#true} assume ~id4~0 >= 0; {1564#true} is VALID [2022-02-20 18:30:59,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {1564#true} assume 0 == ~st4~0; {1564#true} is VALID [2022-02-20 18:30:59,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {1564#true} assume ~send4~0 == ~id4~0; {1564#true} is VALID [2022-02-20 18:30:59,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {1564#true} assume 0 == ~mode4~0 % 256; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,958 INFO L290 TraceCheckUtils]: 50: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,960 INFO L290 TraceCheckUtils]: 54: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,962 INFO L290 TraceCheckUtils]: 58: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,962 INFO L290 TraceCheckUtils]: 59: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,962 INFO L290 TraceCheckUtils]: 60: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,964 INFO L290 TraceCheckUtils]: 64: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,965 INFO L290 TraceCheckUtils]: 65: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,965 INFO L290 TraceCheckUtils]: 66: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,967 INFO L290 TraceCheckUtils]: 71: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,971 INFO L290 TraceCheckUtils]: 79: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:59,971 INFO L290 TraceCheckUtils]: 80: Hoare triple {1566#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {1565#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1565#false} is VALID [2022-02-20 18:30:59,972 INFO L290 TraceCheckUtils]: 82: Hoare triple {1565#false} ~mode4~0 := 0; {1565#false} is VALID [2022-02-20 18:30:59,972 INFO L290 TraceCheckUtils]: 83: Hoare triple {1565#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,972 INFO L290 TraceCheckUtils]: 84: Hoare triple {1565#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,972 INFO L290 TraceCheckUtils]: 85: Hoare triple {1565#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1565#false} is VALID [2022-02-20 18:30:59,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {1565#false} ~mode5~0 := 0; {1565#false} is VALID [2022-02-20 18:30:59,972 INFO L290 TraceCheckUtils]: 87: Hoare triple {1565#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,972 INFO L290 TraceCheckUtils]: 88: Hoare triple {1565#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,973 INFO L290 TraceCheckUtils]: 89: Hoare triple {1565#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1565#false} is VALID [2022-02-20 18:30:59,973 INFO L290 TraceCheckUtils]: 90: Hoare triple {1565#false} ~mode6~0 := 0; {1565#false} is VALID [2022-02-20 18:30:59,973 INFO L290 TraceCheckUtils]: 91: Hoare triple {1565#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,973 INFO L290 TraceCheckUtils]: 92: Hoare triple {1565#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,973 INFO L290 TraceCheckUtils]: 93: Hoare triple {1565#false} assume !(node7_~m7~0#1 != ~nomsg~0); {1565#false} is VALID [2022-02-20 18:30:59,973 INFO L290 TraceCheckUtils]: 94: Hoare triple {1565#false} ~mode7~0 := 0; {1565#false} is VALID [2022-02-20 18:30:59,973 INFO L290 TraceCheckUtils]: 95: Hoare triple {1565#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,974 INFO L290 TraceCheckUtils]: 96: Hoare triple {1565#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1565#false} is VALID [2022-02-20 18:30:59,974 INFO L290 TraceCheckUtils]: 97: Hoare triple {1565#false} assume !(node8_~m8~0#1 != ~nomsg~0); {1565#false} is VALID [2022-02-20 18:30:59,974 INFO L290 TraceCheckUtils]: 98: Hoare triple {1565#false} ~mode8~0 := 0; {1565#false} is VALID [2022-02-20 18:30:59,974 INFO L290 TraceCheckUtils]: 99: Hoare triple {1565#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1565#false} is VALID [2022-02-20 18:30:59,974 INFO L290 TraceCheckUtils]: 100: Hoare triple {1565#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {1565#false} is VALID [2022-02-20 18:30:59,974 INFO L290 TraceCheckUtils]: 101: Hoare triple {1565#false} check_#res#1 := check_~tmp~1#1; {1565#false} is VALID [2022-02-20 18:30:59,975 INFO L290 TraceCheckUtils]: 102: Hoare triple {1565#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1565#false} is VALID [2022-02-20 18:30:59,975 INFO L290 TraceCheckUtils]: 103: Hoare triple {1565#false} assume 0 == assert_~arg#1 % 256; {1565#false} is VALID [2022-02-20 18:30:59,975 INFO L290 TraceCheckUtils]: 104: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2022-02-20 18:30:59,976 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:30:59,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:59,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490287787] [2022-02-20 18:30:59,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490287787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:59,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:59,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:59,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414119499] [2022-02-20 18:30:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:30:59,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:59,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:00,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:00,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:00,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:00,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:00,049 INFO L87 Difference]: Start difference. First operand 145 states and 191 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:00,257 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2022-02-20 18:31:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:00,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:00,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 429 transitions. [2022-02-20 18:31:00,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:00,552 INFO L225 Difference]: With dead ends: 295 [2022-02-20 18:31:00,552 INFO L226 Difference]: Without dead ends: 217 [2022-02-20 18:31:00,553 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:31:00,554 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 102 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 393 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:31:00,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 393 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-20 18:31:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2022-02-20 18:31:00,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:00,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 214 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,560 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 214 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,561 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 215 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 214 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:00,566 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2022-02-20 18:31:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 304 transitions. [2022-02-20 18:31:00,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:00,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:00,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 214 states have internal predecessors, (303), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:31:00,568 INFO L87 Difference]: Start difference. First operand has 215 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 214 states have internal predecessors, (303), 0 states have call successors, (0), 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 217 states. [2022-02-20 18:31:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:00,573 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2022-02-20 18:31:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 304 transitions. [2022-02-20 18:31:00,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:00,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:00,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:00,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4158878504672898) internal successors, (303), 214 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2022-02-20 18:31:00,580 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 105 [2022-02-20 18:31:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:00,581 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2022-02-20 18:31:00,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2022-02-20 18:31:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:00,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:00,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:00,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:31:00,582 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1036099271, now seen corresponding path program 1 times [2022-02-20 18:31:00,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:00,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187179418] [2022-02-20 18:31:00,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:00,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:00,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {2570#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {2570#true} is VALID [2022-02-20 18:31:00,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {2570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2570#true} is VALID [2022-02-20 18:31:00,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {2570#true} assume 0 == ~r1~0 % 256; {2570#true} is VALID [2022-02-20 18:31:00,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {2570#true} assume ~id1~0 >= 0; {2570#true} is VALID [2022-02-20 18:31:00,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {2570#true} assume 0 == ~st1~0; {2570#true} is VALID [2022-02-20 18:31:00,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {2570#true} assume ~send1~0 == ~id1~0; {2570#true} is VALID [2022-02-20 18:31:00,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {2570#true} assume 0 == ~mode1~0 % 256; {2570#true} is VALID [2022-02-20 18:31:00,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {2570#true} assume ~id2~0 >= 0; {2570#true} is VALID [2022-02-20 18:31:00,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {2570#true} assume 0 == ~st2~0; {2570#true} is VALID [2022-02-20 18:31:00,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {2570#true} assume ~send2~0 == ~id2~0; {2570#true} is VALID [2022-02-20 18:31:00,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {2570#true} assume 0 == ~mode2~0 % 256; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {2570#true} assume ~id3~0 >= 0; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {2570#true} assume 0 == ~st3~0; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {2570#true} assume ~send3~0 == ~id3~0; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {2570#true} assume 0 == ~mode3~0 % 256; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2570#true} assume ~id4~0 >= 0; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {2570#true} assume 0 == ~st4~0; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {2570#true} assume ~send4~0 == ~id4~0; {2570#true} is VALID [2022-02-20 18:31:00,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {2570#true} assume 0 == ~mode4~0 % 256; {2570#true} is VALID [2022-02-20 18:31:00,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {2570#true} assume ~id5~0 >= 0; {2570#true} is VALID [2022-02-20 18:31:00,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {2570#true} assume 0 == ~st5~0; {2570#true} is VALID [2022-02-20 18:31:00,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {2570#true} assume ~send5~0 == ~id5~0; {2570#true} is VALID [2022-02-20 18:31:00,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {2570#true} assume 0 == ~mode5~0 % 256; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,687 INFO L290 TraceCheckUtils]: 43: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,695 INFO L290 TraceCheckUtils]: 63: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,695 INFO L290 TraceCheckUtils]: 64: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,697 INFO L290 TraceCheckUtils]: 67: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,697 INFO L290 TraceCheckUtils]: 68: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,697 INFO L290 TraceCheckUtils]: 69: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,698 INFO L290 TraceCheckUtils]: 71: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,699 INFO L290 TraceCheckUtils]: 73: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,699 INFO L290 TraceCheckUtils]: 74: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,700 INFO L290 TraceCheckUtils]: 75: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,700 INFO L290 TraceCheckUtils]: 76: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,702 INFO L290 TraceCheckUtils]: 80: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,702 INFO L290 TraceCheckUtils]: 81: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,702 INFO L290 TraceCheckUtils]: 82: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,703 INFO L290 TraceCheckUtils]: 83: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:00,703 INFO L290 TraceCheckUtils]: 84: Hoare triple {2572#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2571#false} is VALID [2022-02-20 18:31:00,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {2571#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2571#false} is VALID [2022-02-20 18:31:00,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {2571#false} ~mode5~0 := 0; {2571#false} is VALID [2022-02-20 18:31:00,715 INFO L290 TraceCheckUtils]: 87: Hoare triple {2571#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {2571#false} is VALID [2022-02-20 18:31:00,715 INFO L290 TraceCheckUtils]: 88: Hoare triple {2571#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2571#false} is VALID [2022-02-20 18:31:00,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {2571#false} assume !(node6_~m6~0#1 != ~nomsg~0); {2571#false} is VALID [2022-02-20 18:31:00,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {2571#false} ~mode6~0 := 0; {2571#false} is VALID [2022-02-20 18:31:00,715 INFO L290 TraceCheckUtils]: 91: Hoare triple {2571#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 92: Hoare triple {2571#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 93: Hoare triple {2571#false} assume !(node7_~m7~0#1 != ~nomsg~0); {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 94: Hoare triple {2571#false} ~mode7~0 := 0; {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 95: Hoare triple {2571#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 96: Hoare triple {2571#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 97: Hoare triple {2571#false} assume !(node8_~m8~0#1 != ~nomsg~0); {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 98: Hoare triple {2571#false} ~mode8~0 := 0; {2571#false} is VALID [2022-02-20 18:31:00,716 INFO L290 TraceCheckUtils]: 99: Hoare triple {2571#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2571#false} is VALID [2022-02-20 18:31:00,717 INFO L290 TraceCheckUtils]: 100: Hoare triple {2571#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {2571#false} is VALID [2022-02-20 18:31:00,717 INFO L290 TraceCheckUtils]: 101: Hoare triple {2571#false} check_#res#1 := check_~tmp~1#1; {2571#false} is VALID [2022-02-20 18:31:00,717 INFO L290 TraceCheckUtils]: 102: Hoare triple {2571#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2571#false} is VALID [2022-02-20 18:31:00,717 INFO L290 TraceCheckUtils]: 103: Hoare triple {2571#false} assume 0 == assert_~arg#1 % 256; {2571#false} is VALID [2022-02-20 18:31:00,717 INFO L290 TraceCheckUtils]: 104: Hoare triple {2571#false} assume !false; {2571#false} is VALID [2022-02-20 18:31:00,718 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:31:00,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:00,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187179418] [2022-02-20 18:31:00,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187179418] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:00,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:00,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:00,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250546674] [2022-02-20 18:31:00,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:00,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:00,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:00,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:00,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:00,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:00,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:00,784 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:01,003 INFO L93 Difference]: Finished difference Result 499 states and 755 transitions. [2022-02-20 18:31:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:01,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 429 transitions. [2022-02-20 18:31:01,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:01,278 INFO L225 Difference]: With dead ends: 499 [2022-02-20 18:31:01,278 INFO L226 Difference]: Without dead ends: 351 [2022-02-20 18:31:01,279 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:31:01,282 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 98 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 392 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:31:01,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 392 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-20 18:31:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-02-20 18:31:01,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:01,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.4827586206896552) internal successors, (516), 348 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,297 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.4827586206896552) internal successors, (516), 348 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,298 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.4827586206896552) internal successors, (516), 348 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:01,308 INFO L93 Difference]: Finished difference Result 351 states and 517 transitions. [2022-02-20 18:31:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 517 transitions. [2022-02-20 18:31:01,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:01,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:01,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 348 states have (on average 1.4827586206896552) internal successors, (516), 348 states have internal predecessors, (516), 0 states have call successors, (0), 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 351 states. [2022-02-20 18:31:01,310 INFO L87 Difference]: Start difference. First operand has 349 states, 348 states have (on average 1.4827586206896552) internal successors, (516), 348 states have internal predecessors, (516), 0 states have call successors, (0), 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 351 states. [2022-02-20 18:31:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:01,318 INFO L93 Difference]: Finished difference Result 351 states and 517 transitions. [2022-02-20 18:31:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 517 transitions. [2022-02-20 18:31:01,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:01,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:01,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:01,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.4827586206896552) internal successors, (516), 348 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 516 transitions. [2022-02-20 18:31:01,327 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 516 transitions. Word has length 105 [2022-02-20 18:31:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:01,328 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 516 transitions. [2022-02-20 18:31:01,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 516 transitions. [2022-02-20 18:31:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:01,329 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:01,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:01,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:31:01,329 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash -903931587, now seen corresponding path program 1 times [2022-02-20 18:31:01,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:01,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708688934] [2022-02-20 18:31:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:01,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {4237#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {4237#true} is VALID [2022-02-20 18:31:01,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {4237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {4237#true} is VALID [2022-02-20 18:31:01,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {4237#true} assume 0 == ~r1~0 % 256; {4237#true} is VALID [2022-02-20 18:31:01,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {4237#true} assume ~id1~0 >= 0; {4237#true} is VALID [2022-02-20 18:31:01,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {4237#true} assume 0 == ~st1~0; {4237#true} is VALID [2022-02-20 18:31:01,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {4237#true} assume ~send1~0 == ~id1~0; {4237#true} is VALID [2022-02-20 18:31:01,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {4237#true} assume 0 == ~mode1~0 % 256; {4237#true} is VALID [2022-02-20 18:31:01,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {4237#true} assume ~id2~0 >= 0; {4237#true} is VALID [2022-02-20 18:31:01,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {4237#true} assume 0 == ~st2~0; {4237#true} is VALID [2022-02-20 18:31:01,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {4237#true} assume ~send2~0 == ~id2~0; {4237#true} is VALID [2022-02-20 18:31:01,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {4237#true} assume 0 == ~mode2~0 % 256; {4237#true} is VALID [2022-02-20 18:31:01,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {4237#true} assume ~id3~0 >= 0; {4237#true} is VALID [2022-02-20 18:31:01,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {4237#true} assume 0 == ~st3~0; {4237#true} is VALID [2022-02-20 18:31:01,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {4237#true} assume ~send3~0 == ~id3~0; {4237#true} is VALID [2022-02-20 18:31:01,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {4237#true} assume 0 == ~mode3~0 % 256; {4237#true} is VALID [2022-02-20 18:31:01,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {4237#true} assume ~id4~0 >= 0; {4237#true} is VALID [2022-02-20 18:31:01,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {4237#true} assume 0 == ~st4~0; {4237#true} is VALID [2022-02-20 18:31:01,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {4237#true} assume ~send4~0 == ~id4~0; {4237#true} is VALID [2022-02-20 18:31:01,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {4237#true} assume 0 == ~mode4~0 % 256; {4237#true} is VALID [2022-02-20 18:31:01,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#true} assume ~id5~0 >= 0; {4237#true} is VALID [2022-02-20 18:31:01,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {4237#true} assume 0 == ~st5~0; {4237#true} is VALID [2022-02-20 18:31:01,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {4237#true} assume ~send5~0 == ~id5~0; {4237#true} is VALID [2022-02-20 18:31:01,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {4237#true} assume 0 == ~mode5~0 % 256; {4237#true} is VALID [2022-02-20 18:31:01,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {4237#true} assume ~id6~0 >= 0; {4237#true} is VALID [2022-02-20 18:31:01,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {4237#true} assume 0 == ~st6~0; {4237#true} is VALID [2022-02-20 18:31:01,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {4237#true} assume ~send6~0 == ~id6~0; {4237#true} is VALID [2022-02-20 18:31:01,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {4237#true} assume 0 == ~mode6~0 % 256; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,492 INFO L290 TraceCheckUtils]: 64: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,495 INFO L290 TraceCheckUtils]: 67: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,498 INFO L290 TraceCheckUtils]: 70: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,500 INFO L290 TraceCheckUtils]: 74: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,502 INFO L290 TraceCheckUtils]: 79: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,503 INFO L290 TraceCheckUtils]: 80: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,503 INFO L290 TraceCheckUtils]: 81: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,504 INFO L290 TraceCheckUtils]: 82: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,506 INFO L290 TraceCheckUtils]: 83: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,507 INFO L290 TraceCheckUtils]: 84: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,507 INFO L290 TraceCheckUtils]: 85: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {4239#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {4238#false} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 89: Hoare triple {4238#false} assume !(node6_~m6~0#1 != ~nomsg~0); {4238#false} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 90: Hoare triple {4238#false} ~mode6~0 := 0; {4238#false} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 91: Hoare triple {4238#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {4238#false} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 92: Hoare triple {4238#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {4238#false} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 93: Hoare triple {4238#false} assume !(node7_~m7~0#1 != ~nomsg~0); {4238#false} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 94: Hoare triple {4238#false} ~mode7~0 := 0; {4238#false} is VALID [2022-02-20 18:31:01,509 INFO L290 TraceCheckUtils]: 95: Hoare triple {4238#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {4238#false} is VALID [2022-02-20 18:31:01,510 INFO L290 TraceCheckUtils]: 96: Hoare triple {4238#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {4238#false} is VALID [2022-02-20 18:31:01,510 INFO L290 TraceCheckUtils]: 97: Hoare triple {4238#false} assume !(node8_~m8~0#1 != ~nomsg~0); {4238#false} is VALID [2022-02-20 18:31:01,510 INFO L290 TraceCheckUtils]: 98: Hoare triple {4238#false} ~mode8~0 := 0; {4238#false} is VALID [2022-02-20 18:31:01,510 INFO L290 TraceCheckUtils]: 99: Hoare triple {4238#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {4238#false} is VALID [2022-02-20 18:31:01,510 INFO L290 TraceCheckUtils]: 100: Hoare triple {4238#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {4238#false} is VALID [2022-02-20 18:31:01,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {4238#false} check_#res#1 := check_~tmp~1#1; {4238#false} is VALID [2022-02-20 18:31:01,511 INFO L290 TraceCheckUtils]: 102: Hoare triple {4238#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {4238#false} is VALID [2022-02-20 18:31:01,511 INFO L290 TraceCheckUtils]: 103: Hoare triple {4238#false} assume 0 == assert_~arg#1 % 256; {4238#false} is VALID [2022-02-20 18:31:01,511 INFO L290 TraceCheckUtils]: 104: Hoare triple {4238#false} assume !false; {4238#false} is VALID [2022-02-20 18:31:01,513 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:31:01,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:01,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708688934] [2022-02-20 18:31:01,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708688934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:01,514 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:01,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:01,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356096202] [2022-02-20 18:31:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:01,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:01,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:01,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:01,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:01,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:01,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:01,581 INFO L87 Difference]: Start difference. First operand 349 states and 516 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:01,889 INFO L93 Difference]: Finished difference Result 889 states and 1374 transitions. [2022-02-20 18:31:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:01,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:01,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 429 transitions. [2022-02-20 18:31:02,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:02,198 INFO L225 Difference]: With dead ends: 889 [2022-02-20 18:31:02,198 INFO L226 Difference]: Without dead ends: 607 [2022-02-20 18:31:02,200 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:31:02,200 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 94 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 391 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:31:02,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-02-20 18:31:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2022-02-20 18:31:02,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:02,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 607 states. Second operand has 605 states, 604 states have (on average 1.5231788079470199) internal successors, (920), 604 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,225 INFO L74 IsIncluded]: Start isIncluded. First operand 607 states. Second operand has 605 states, 604 states have (on average 1.5231788079470199) internal successors, (920), 604 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,226 INFO L87 Difference]: Start difference. First operand 607 states. Second operand has 605 states, 604 states have (on average 1.5231788079470199) internal successors, (920), 604 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:02,240 INFO L93 Difference]: Finished difference Result 607 states and 921 transitions. [2022-02-20 18:31:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 921 transitions. [2022-02-20 18:31:02,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:02,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:02,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 605 states, 604 states have (on average 1.5231788079470199) internal successors, (920), 604 states have internal predecessors, (920), 0 states have call successors, (0), 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 607 states. [2022-02-20 18:31:02,243 INFO L87 Difference]: Start difference. First operand has 605 states, 604 states have (on average 1.5231788079470199) internal successors, (920), 604 states have internal predecessors, (920), 0 states have call successors, (0), 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 607 states. [2022-02-20 18:31:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:02,257 INFO L93 Difference]: Finished difference Result 607 states and 921 transitions. [2022-02-20 18:31:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 921 transitions. [2022-02-20 18:31:02,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:02,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:02,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:02,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.5231788079470199) internal successors, (920), 604 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 920 transitions. [2022-02-20 18:31:02,274 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 920 transitions. Word has length 105 [2022-02-20 18:31:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:02,274 INFO L470 AbstractCegarLoop]: Abstraction has 605 states and 920 transitions. [2022-02-20 18:31:02,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 920 transitions. [2022-02-20 18:31:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:02,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:02,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:02,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:31:02,277 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1796751027, now seen corresponding path program 1 times [2022-02-20 18:31:02,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:02,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110682776] [2022-02-20 18:31:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:02,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {7172#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {7172#true} is VALID [2022-02-20 18:31:02,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {7172#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {7172#true} is VALID [2022-02-20 18:31:02,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {7172#true} assume 0 == ~r1~0 % 256; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {7172#true} assume ~id1~0 >= 0; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {7172#true} assume 0 == ~st1~0; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {7172#true} assume ~send1~0 == ~id1~0; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {7172#true} assume 0 == ~mode1~0 % 256; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {7172#true} assume ~id2~0 >= 0; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {7172#true} assume 0 == ~st2~0; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {7172#true} assume ~send2~0 == ~id2~0; {7172#true} is VALID [2022-02-20 18:31:02,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {7172#true} assume 0 == ~mode2~0 % 256; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {7172#true} assume ~id3~0 >= 0; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {7172#true} assume 0 == ~st3~0; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {7172#true} assume ~send3~0 == ~id3~0; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {7172#true} assume 0 == ~mode3~0 % 256; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {7172#true} assume ~id4~0 >= 0; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {7172#true} assume 0 == ~st4~0; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {7172#true} assume ~send4~0 == ~id4~0; {7172#true} is VALID [2022-02-20 18:31:02,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {7172#true} assume 0 == ~mode4~0 % 256; {7172#true} is VALID [2022-02-20 18:31:02,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {7172#true} assume ~id5~0 >= 0; {7172#true} is VALID [2022-02-20 18:31:02,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {7172#true} assume 0 == ~st5~0; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {7172#true} assume ~send5~0 == ~id5~0; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {7172#true} assume 0 == ~mode5~0 % 256; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {7172#true} assume ~id6~0 >= 0; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {7172#true} assume 0 == ~st6~0; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {7172#true} assume ~send6~0 == ~id6~0; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {7172#true} assume 0 == ~mode6~0 % 256; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {7172#true} assume ~id7~0 >= 0; {7172#true} is VALID [2022-02-20 18:31:02,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {7172#true} assume 0 == ~st7~0; {7172#true} is VALID [2022-02-20 18:31:02,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {7172#true} assume ~send7~0 == ~id7~0; {7172#true} is VALID [2022-02-20 18:31:02,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {7172#true} assume 0 == ~mode7~0 % 256; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id8~0 >= 0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~st8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send8~0 == ~id8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~mode8~0 % 256; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id8~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,386 INFO L290 TraceCheckUtils]: 81: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,386 INFO L290 TraceCheckUtils]: 82: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,387 INFO L290 TraceCheckUtils]: 83: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,387 INFO L290 TraceCheckUtils]: 84: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,387 INFO L290 TraceCheckUtils]: 85: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,388 INFO L290 TraceCheckUtils]: 88: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,391 INFO L290 TraceCheckUtils]: 90: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,392 INFO L290 TraceCheckUtils]: 91: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {7174#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {7173#false} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {7173#false} assume !(node7_~m7~0#1 != ~nomsg~0); {7173#false} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 94: Hoare triple {7173#false} ~mode7~0 := 0; {7173#false} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {7173#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {7173#false} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {7173#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {7173#false} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {7173#false} assume !(node8_~m8~0#1 != ~nomsg~0); {7173#false} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 98: Hoare triple {7173#false} ~mode8~0 := 0; {7173#false} is VALID [2022-02-20 18:31:02,393 INFO L290 TraceCheckUtils]: 99: Hoare triple {7173#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7173#false} is VALID [2022-02-20 18:31:02,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {7173#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {7173#false} is VALID [2022-02-20 18:31:02,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {7173#false} check_#res#1 := check_~tmp~1#1; {7173#false} is VALID [2022-02-20 18:31:02,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {7173#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {7173#false} is VALID [2022-02-20 18:31:02,394 INFO L290 TraceCheckUtils]: 103: Hoare triple {7173#false} assume 0 == assert_~arg#1 % 256; {7173#false} is VALID [2022-02-20 18:31:02,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {7173#false} assume !false; {7173#false} is VALID [2022-02-20 18:31:02,394 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:31:02,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:02,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110682776] [2022-02-20 18:31:02,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110682776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:02,395 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:02,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:02,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572879310] [2022-02-20 18:31:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:02,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:02,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:02,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:02,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:02,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:02,472 INFO L87 Difference]: Start difference. First operand 605 states and 920 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:02,769 INFO L93 Difference]: Finished difference Result 1633 states and 2546 transitions. [2022-02-20 18:31:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:02,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:02,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 429 transitions. [2022-02-20 18:31:03,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:03,131 INFO L225 Difference]: With dead ends: 1633 [2022-02-20 18:31:03,131 INFO L226 Difference]: Without dead ends: 1095 [2022-02-20 18:31:03,132 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:31:03,132 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 90 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 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:31:03,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 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:31:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-02-20 18:31:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1093. [2022-02-20 18:31:03,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:03,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1095 states. Second operand has 1093 states, 1092 states have (on average 1.5421245421245422) internal successors, (1684), 1092 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,158 INFO L74 IsIncluded]: Start isIncluded. First operand 1095 states. Second operand has 1093 states, 1092 states have (on average 1.5421245421245422) internal successors, (1684), 1092 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,159 INFO L87 Difference]: Start difference. First operand 1095 states. Second operand has 1093 states, 1092 states have (on average 1.5421245421245422) internal successors, (1684), 1092 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:03,202 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2022-02-20 18:31:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1685 transitions. [2022-02-20 18:31:03,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:03,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:03,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 1093 states, 1092 states have (on average 1.5421245421245422) internal successors, (1684), 1092 states have internal predecessors, (1684), 0 states have call successors, (0), 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 1095 states. [2022-02-20 18:31:03,206 INFO L87 Difference]: Start difference. First operand has 1093 states, 1092 states have (on average 1.5421245421245422) internal successors, (1684), 1092 states have internal predecessors, (1684), 0 states have call successors, (0), 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 1095 states. [2022-02-20 18:31:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:03,244 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2022-02-20 18:31:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1685 transitions. [2022-02-20 18:31:03,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:03,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:03,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:03,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 1.5421245421245422) internal successors, (1684), 1092 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1684 transitions. [2022-02-20 18:31:03,290 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1684 transitions. Word has length 105 [2022-02-20 18:31:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:03,291 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1684 transitions. [2022-02-20 18:31:03,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1684 transitions. [2022-02-20 18:31:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:03,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:03,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:03,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:31:03,292 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2134544169, now seen corresponding path program 1 times [2022-02-20 18:31:03,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:03,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372674929] [2022-02-20 18:31:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:03,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {12535#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {12535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {12535#true} assume 0 == ~r1~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {12535#true} assume ~id1~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {12535#true} assume 0 == ~st1~0; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {12535#true} assume ~send1~0 == ~id1~0; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {12535#true} assume 0 == ~mode1~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {12535#true} assume ~id2~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {12535#true} assume 0 == ~st2~0; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {12535#true} assume ~send2~0 == ~id2~0; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {12535#true} assume 0 == ~mode2~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {12535#true} assume ~id3~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {12535#true} assume 0 == ~st3~0; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {12535#true} assume ~send3~0 == ~id3~0; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {12535#true} assume 0 == ~mode3~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {12535#true} assume ~id4~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {12535#true} assume 0 == ~st4~0; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {12535#true} assume ~send4~0 == ~id4~0; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {12535#true} assume 0 == ~mode4~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {12535#true} assume ~id5~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {12535#true} assume 0 == ~st5~0; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {12535#true} assume ~send5~0 == ~id5~0; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {12535#true} assume 0 == ~mode5~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {12535#true} assume ~id6~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {12535#true} assume 0 == ~st6~0; {12535#true} is VALID [2022-02-20 18:31:03,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {12535#true} assume ~send6~0 == ~id6~0; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {12535#true} assume 0 == ~mode6~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {12535#true} assume ~id7~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {12535#true} assume 0 == ~st7~0; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {12535#true} assume ~send7~0 == ~id7~0; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {12535#true} assume 0 == ~mode7~0 % 256; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {12535#true} assume ~id8~0 >= 0; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {12535#true} assume 0 == ~st8~0; {12535#true} is VALID [2022-02-20 18:31:03,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {12535#true} assume ~send8~0 == ~id8~0; {12535#true} is VALID [2022-02-20 18:31:03,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {12535#true} assume 0 == ~mode8~0 % 256; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id2~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id3~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id4~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id5~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id6~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id7~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id8~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id3~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id4~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id5~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id6~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id7~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id8~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id4~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id5~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id6~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id7~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id8~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id5~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id6~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id7~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id8~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id6~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id7~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id8~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id7~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id8~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,380 INFO L290 TraceCheckUtils]: 63: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} init_#res#1 := init_~tmp~0#1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,381 INFO L290 TraceCheckUtils]: 67: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode1~0 % 256); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode2~0 % 256); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode3~0 % 256); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,385 INFO L290 TraceCheckUtils]: 78: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,385 INFO L290 TraceCheckUtils]: 79: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,386 INFO L290 TraceCheckUtils]: 80: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode4~0 % 256); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,386 INFO L290 TraceCheckUtils]: 81: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,386 INFO L290 TraceCheckUtils]: 82: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,387 INFO L290 TraceCheckUtils]: 83: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,387 INFO L290 TraceCheckUtils]: 84: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode5~0 % 256); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,388 INFO L290 TraceCheckUtils]: 85: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,389 INFO L290 TraceCheckUtils]: 88: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode6~0 % 256); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,389 INFO L290 TraceCheckUtils]: 90: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,390 INFO L290 TraceCheckUtils]: 91: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,390 INFO L290 TraceCheckUtils]: 92: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode7~0 % 256); {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,390 INFO L290 TraceCheckUtils]: 93: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,391 INFO L290 TraceCheckUtils]: 94: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,391 INFO L290 TraceCheckUtils]: 95: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 18:31:03,391 INFO L290 TraceCheckUtils]: 96: Hoare triple {12537#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 97: Hoare triple {12536#false} assume !(node8_~m8~0#1 != ~nomsg~0); {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 98: Hoare triple {12536#false} ~mode8~0 := 0; {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 99: Hoare triple {12536#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 100: Hoare triple {12536#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 101: Hoare triple {12536#false} check_#res#1 := check_~tmp~1#1; {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 102: Hoare triple {12536#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 103: Hoare triple {12536#false} assume 0 == assert_~arg#1 % 256; {12536#false} is VALID [2022-02-20 18:31:03,392 INFO L290 TraceCheckUtils]: 104: Hoare triple {12536#false} assume !false; {12536#false} is VALID [2022-02-20 18:31:03,393 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:31:03,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:03,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372674929] [2022-02-20 18:31:03,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372674929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:03,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:03,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:03,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128158212] [2022-02-20 18:31:03,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:03,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:03,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:03,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:03,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:03,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:03,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:03,458 INFO L87 Difference]: Start difference. First operand 1093 states and 1684 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:04,113 INFO L93 Difference]: Finished difference Result 3049 states and 4758 transitions. [2022-02-20 18:31:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:04,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-02-20 18:31:04,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 429 transitions. [2022-02-20 18:31:04,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:04,498 INFO L225 Difference]: With dead ends: 3049 [2022-02-20 18:31:04,498 INFO L226 Difference]: Without dead ends: 2023 [2022-02-20 18:31:04,499 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:31:04,500 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 86 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 389 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:31:04,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 389 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2022-02-20 18:31:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2021. [2022-02-20 18:31:04,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:04,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2023 states. Second operand has 2021 states, 2020 states have (on average 1.5465346534653466) internal successors, (3124), 2020 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,577 INFO L74 IsIncluded]: Start isIncluded. First operand 2023 states. Second operand has 2021 states, 2020 states have (on average 1.5465346534653466) internal successors, (3124), 2020 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,580 INFO L87 Difference]: Start difference. First operand 2023 states. Second operand has 2021 states, 2020 states have (on average 1.5465346534653466) internal successors, (3124), 2020 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:04,704 INFO L93 Difference]: Finished difference Result 2023 states and 3125 transitions. [2022-02-20 18:31:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 3125 transitions. [2022-02-20 18:31:04,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:04,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:04,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 2021 states, 2020 states have (on average 1.5465346534653466) internal successors, (3124), 2020 states have internal predecessors, (3124), 0 states have call successors, (0), 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 2023 states. [2022-02-20 18:31:04,712 INFO L87 Difference]: Start difference. First operand has 2021 states, 2020 states have (on average 1.5465346534653466) internal successors, (3124), 2020 states have internal predecessors, (3124), 0 states have call successors, (0), 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 2023 states. [2022-02-20 18:31:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:04,837 INFO L93 Difference]: Finished difference Result 2023 states and 3125 transitions. [2022-02-20 18:31:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 3125 transitions. [2022-02-20 18:31:04,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:04,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:04,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:04,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2020 states have (on average 1.5465346534653466) internal successors, (3124), 2020 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 3124 transitions. [2022-02-20 18:31:04,998 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 3124 transitions. Word has length 105 [2022-02-20 18:31:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:04,998 INFO L470 AbstractCegarLoop]: Abstraction has 2021 states and 3124 transitions. [2022-02-20 18:31:04,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 3124 transitions. [2022-02-20 18:31:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:04,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:04,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:05,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:31:05,000 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash -942437729, now seen corresponding path program 1 times [2022-02-20 18:31:05,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:05,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281247704] [2022-02-20 18:31:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:05,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {22538#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(34, 2);call #Ultimate.allocInit(12, 3);~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;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; {22538#true} is VALID [2022-02-20 18:31:05,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {22538#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode5~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~id6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~send6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~mode6~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~id7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;assume -128 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 127;~st7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume -128 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 127;~send7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~mode7~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;assume -128 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 127;~id8~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;assume -128 <= main_#t~nondet42#1 && main_#t~nondet42#1 <= 127;~st8~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;assume -128 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 127;~send8~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~mode8~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22538#true} is VALID [2022-02-20 18:31:05,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {22538#true} assume 0 == ~r1~0 % 256; {22538#true} is VALID [2022-02-20 18:31:05,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {22538#true} assume ~id1~0 >= 0; {22538#true} is VALID [2022-02-20 18:31:05,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {22538#true} assume 0 == ~st1~0; {22540#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:05,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {22540#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {22540#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:05,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {22540#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {22540#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:05,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {22540#(<= ~st1~0 0)} assume ~id2~0 >= 0; {22540#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:05,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {22540#(<= ~st1~0 0)} assume 0 == ~st2~0; {22541#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {22541#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {22541#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {22541#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {22541#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {22541#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {22541#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {22541#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {22542#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {22543#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:05,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {22544#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {22545#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id8~0 >= 0; {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {22546#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~st8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 == ~id8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode8~0 % 256; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,117 INFO L290 TraceCheckUtils]: 42: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,118 INFO L290 TraceCheckUtils]: 46: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,122 INFO L290 TraceCheckUtils]: 59: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,123 INFO L290 TraceCheckUtils]: 61: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,123 INFO L290 TraceCheckUtils]: 62: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,124 INFO L290 TraceCheckUtils]: 64: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main_#t~ret45#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647;main_~i2~0#1 := main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,124 INFO L290 TraceCheckUtils]: 65: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,124 INFO L290 TraceCheckUtils]: 66: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,125 INFO L290 TraceCheckUtils]: 67: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,125 INFO L290 TraceCheckUtils]: 68: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,125 INFO L290 TraceCheckUtils]: 69: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,126 INFO L290 TraceCheckUtils]: 71: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,126 INFO L290 TraceCheckUtils]: 72: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,127 INFO L290 TraceCheckUtils]: 73: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,127 INFO L290 TraceCheckUtils]: 74: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,127 INFO L290 TraceCheckUtils]: 75: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,128 INFO L290 TraceCheckUtils]: 77: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,128 INFO L290 TraceCheckUtils]: 78: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,129 INFO L290 TraceCheckUtils]: 79: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,129 INFO L290 TraceCheckUtils]: 80: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,129 INFO L290 TraceCheckUtils]: 81: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,130 INFO L290 TraceCheckUtils]: 82: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,130 INFO L290 TraceCheckUtils]: 83: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,130 INFO L290 TraceCheckUtils]: 84: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,131 INFO L290 TraceCheckUtils]: 85: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,131 INFO L290 TraceCheckUtils]: 86: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,131 INFO L290 TraceCheckUtils]: 87: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,132 INFO L290 TraceCheckUtils]: 88: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,132 INFO L290 TraceCheckUtils]: 89: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,132 INFO L290 TraceCheckUtils]: 90: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,133 INFO L290 TraceCheckUtils]: 91: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,133 INFO L290 TraceCheckUtils]: 92: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,133 INFO L290 TraceCheckUtils]: 93: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,133 INFO L290 TraceCheckUtils]: 94: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,134 INFO L290 TraceCheckUtils]: 95: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite11#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,134 INFO L290 TraceCheckUtils]: 96: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode8~0 % 256); {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,134 INFO L290 TraceCheckUtils]: 97: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,135 INFO L290 TraceCheckUtils]: 98: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p8_new~0 := (if node8_#t~ite11#1 % 256 <= 127 then node8_#t~ite11#1 % 256 else node8_#t~ite11#1 % 256 - 256);havoc node8_#t~ite11#1;~mode8~0 := 1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,135 INFO L290 TraceCheckUtils]: 99: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:05,136 INFO L290 TraceCheckUtils]: 100: Hoare triple {22547#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {22539#false} is VALID [2022-02-20 18:31:05,136 INFO L290 TraceCheckUtils]: 101: Hoare triple {22539#false} check_#res#1 := check_~tmp~1#1; {22539#false} is VALID [2022-02-20 18:31:05,136 INFO L290 TraceCheckUtils]: 102: Hoare triple {22539#false} main_#t~ret46#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret46#1 && main_#t~ret46#1 <= 2147483647;main_~c1~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22539#false} is VALID [2022-02-20 18:31:05,136 INFO L290 TraceCheckUtils]: 103: Hoare triple {22539#false} assume 0 == assert_~arg#1 % 256; {22539#false} is VALID [2022-02-20 18:31:05,136 INFO L290 TraceCheckUtils]: 104: Hoare triple {22539#false} assume !false; {22539#false} is VALID [2022-02-20 18:31:05,136 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:31:05,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:05,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281247704] [2022-02-20 18:31:05,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281247704] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:05,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:05,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:31:05,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036455941] [2022-02-20 18:31:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:05,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-02-20 18:31:05,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:05,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:05,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:05,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:31:05,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:05,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:31:05,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:31:05,211 INFO L87 Difference]: Start difference. First operand 2021 states and 3124 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)