./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.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_overflow.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 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:31:12,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:31:12,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:31:12,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:31:12,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:31:12,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:31:12,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:31:12,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:31:12,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:31:12,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:31:12,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:31:12,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:31:12,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:31:12,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:31:12,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:31:12,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:31:12,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:31:12,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:31:12,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:31:12,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:31:12,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:31:12,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:31:12,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:31:12,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:31:12,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:31:12,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:31:12,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:31:12,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:31:12,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:31:12,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:31:12,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:31:12,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:31:12,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:31:12,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:31:12,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:31:12,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:31:12,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:31:12,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:31:12,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:31:12,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:31:12,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:31:12,996 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:31:13,025 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:31:13,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:31:13,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:31:13,026 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:31:13,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:31:13,027 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:31:13,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:31:13,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:31:13,029 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:31:13,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:31:13,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:31:13,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:31:13,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:31:13,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:31:13,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:31:13,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:31:13,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:31:13,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:31:13,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:31:13,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:31:13,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:31:13,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:31:13,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:31:13,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:31:13,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:13,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:31:13,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:31:13,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:31:13,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:31:13,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:31:13,034 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:31:13,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:31:13,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:31:13,035 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 -> 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 [2022-02-20 18:31:13,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:31:13,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:31:13,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:31:13,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:31:13,302 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:31:13,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:13,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe1788d9/e6a0468b37b54099a6a04a106bf9e0d3/FLAG2d59ae608 [2022-02-20 18:31:13,791 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:31:13,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:13,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe1788d9/e6a0468b37b54099a6a04a106bf9e0d3/FLAG2d59ae608 [2022-02-20 18:31:14,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe1788d9/e6a0468b37b54099a6a04a106bf9e0d3 [2022-02-20 18:31:14,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:31:14,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:31:14,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:14,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:31:14,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:31:14,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31381054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14, skipping insertion in model container [2022-02-20 18:31:14,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:31:14,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:31:14,566 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_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2022-02-20 18:31:14,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:14,595 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:31:14,674 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_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2022-02-20 18:31:14,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:14,689 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:31:14,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14 WrapperNode [2022-02-20 18:31:14,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:14,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:14,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:31:14,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:31:14,698 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:31:14" (1/1) ... [2022-02-20 18:31:14,719 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:31:14" (1/1) ... [2022-02-20 18:31:14,768 INFO L137 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 520 [2022-02-20 18:31:14,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:14,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:31:14,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:31:14,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:31:14,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:31:14,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:31:14,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:31:14,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:31:14,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (1/1) ... [2022-02-20 18:31:14,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:14,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:31:14,856 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:31:14,863 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:31:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:31:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:31:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:31:14,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:31:14,982 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:31:14,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:31:15,711 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:31:15,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:31:15,723 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:31:15,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:15 BoogieIcfgContainer [2022-02-20 18:31:15,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:31:15,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:31:15,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:31:15,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:31:15,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:31:14" (1/3) ... [2022-02-20 18:31:15,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586b0e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:15, skipping insertion in model container [2022-02-20 18:31:15,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:14" (2/3) ... [2022-02-20 18:31:15,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586b0e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:15, skipping insertion in model container [2022-02-20 18:31:15,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:15" (3/3) ... [2022-02-20 18:31:15,737 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:15,741 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:31:15,741 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:31:15,782 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:31:15,791 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:31:15,791 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:31:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 146 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:31:15,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:15,826 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:31:15,827 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash -486996250, now seen corresponding path program 1 times [2022-02-20 18:31:15,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:15,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917852266] [2022-02-20 18:31:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:16,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#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(41, 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]; {150#true} is VALID [2022-02-20 18:31:16,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#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; {150#true} is VALID [2022-02-20 18:31:16,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {150#true} is VALID [2022-02-20 18:31:16,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#true} init_#res#1 := init_~tmp~0#1; {150#true} is VALID [2022-02-20 18:31:16,098 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#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; {150#true} is VALID [2022-02-20 18:31:16,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {151#false} is VALID [2022-02-20 18:31:16,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:31:16,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#false} assume !(node1_~m1~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:31:16,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#false} ~mode1~0 := 0; {151#false} is VALID [2022-02-20 18:31:16,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:31:16,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#false} assume !(node2_~m2~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:31:16,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {151#false} ~mode2~0 := 0; {151#false} is VALID [2022-02-20 18:31:16,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {151#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:31:16,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {151#false} assume !(node3_~m3~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:31:16,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {151#false} ~mode3~0 := 0; {151#false} is VALID [2022-02-20 18:31:16,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {151#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:31:16,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {151#false} assume !(node4_~m4~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:31:16,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {151#false} ~mode4~0 := 0; {151#false} is VALID [2022-02-20 18:31:16,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {151#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:31:16,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {151#false} assume !(node5_~m5~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:31:16,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {151#false} ~mode5~0 := 0; {151#false} is VALID [2022-02-20 18:31:16,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {151#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {151#false} is VALID [2022-02-20 18:31:16,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {151#false} assume !(node6_~m6~0#1 != ~nomsg~0); {151#false} is VALID [2022-02-20 18:31:16,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {151#false} ~mode6~0 := 0; {151#false} is VALID [2022-02-20 18:31:16,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {151#false} assume !(0 != ~mode7~0 % 256); {151#false} is VALID [2022-02-20 18:31:16,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {151#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {151#false} is VALID [2022-02-20 18:31:16,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {151#false} ~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; {151#false} is VALID [2022-02-20 18:31:16,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {151#false} assume !(0 != ~mode8~0 % 256); {151#false} is VALID [2022-02-20 18:31:16,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {151#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {151#false} is VALID [2022-02-20 18:31:16,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {151#false} ~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; {151#false} is VALID [2022-02-20 18:31:16,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {151#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {151#false} is VALID [2022-02-20 18:31:16,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {151#false} check_#res#1 := check_~tmp~1#1; {151#false} is VALID [2022-02-20 18:31:16,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {151#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; {151#false} is VALID [2022-02-20 18:31:16,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {151#false} assume 0 == assert_~arg#1 % 256; {151#false} is VALID [2022-02-20 18:31:16,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {151#false} assume !false; {151#false} is VALID [2022-02-20 18:31:16,118 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:16,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:16,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917852266] [2022-02-20 18:31:16,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917852266] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:16,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:16,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:31:16,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053744092] [2022-02-20 18:31:16,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:16,128 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:31:16,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:16,132 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:31:16,174 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:31:16,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:31:16,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:31:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:31:16,205 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 146 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:31:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:16,381 INFO L93 Difference]: Finished difference Result 224 states and 381 transitions. [2022-02-20 18:31:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:31:16,381 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:31:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:16,383 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:31:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 381 transitions. [2022-02-20 18:31:16,394 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:31:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 381 transitions. [2022-02-20 18:31:16,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 381 transitions. [2022-02-20 18:31:16,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:16,744 INFO L225 Difference]: With dead ends: 224 [2022-02-20 18:31:16,744 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 18:31:16,748 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:31:16,752 INFO L933 BasicCegarLoop]: 249 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, 249 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:31:16,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 18:31:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-20 18:31:16,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:16,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call 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:16,786 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call 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:16,786 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call 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:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:16,802 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2022-02-20 18:31:16,802 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2022-02-20 18:31:16,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:16,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:16,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:31:16,806 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:31:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:16,818 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2022-02-20 18:31:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2022-02-20 18:31:16,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:16,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:16,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:16,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.7535211267605635) internal successors, (249), 142 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call 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:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 249 transitions. [2022-02-20 18:31:16,830 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 249 transitions. Word has length 45 [2022-02-20 18:31:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:16,831 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 249 transitions. [2022-02-20 18:31:16,831 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:31:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 249 transitions. [2022-02-20 18:31:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:31:16,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:16,836 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:31:16,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:31:16,837 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1858803548, now seen corresponding path program 1 times [2022-02-20 18:31:16,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:16,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464044767] [2022-02-20 18:31:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:17,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {843#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(41, 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]; {843#true} is VALID [2022-02-20 18:31:17,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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; {843#true} is VALID [2022-02-20 18:31:17,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {845#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:31:17,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {845#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {846#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:31:17,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {846#(= |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; {847#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:31:17,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {847#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {844#false} is VALID [2022-02-20 18:31:17,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {844#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {844#false} is VALID [2022-02-20 18:31:17,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#false} assume !(node1_~m1~0#1 != ~nomsg~0); {844#false} is VALID [2022-02-20 18:31:17,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#false} ~mode1~0 := 0; {844#false} is VALID [2022-02-20 18:31:17,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {844#false} is VALID [2022-02-20 18:31:17,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#false} assume !(node2_~m2~0#1 != ~nomsg~0); {844#false} is VALID [2022-02-20 18:31:17,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} ~mode2~0 := 0; {844#false} is VALID [2022-02-20 18:31:17,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {844#false} is VALID [2022-02-20 18:31:17,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {844#false} assume !(node3_~m3~0#1 != ~nomsg~0); {844#false} is VALID [2022-02-20 18:31:17,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {844#false} ~mode3~0 := 0; {844#false} is VALID [2022-02-20 18:31:17,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {844#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {844#false} is VALID [2022-02-20 18:31:17,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {844#false} assume !(node4_~m4~0#1 != ~nomsg~0); {844#false} is VALID [2022-02-20 18:31:17,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {844#false} ~mode4~0 := 0; {844#false} is VALID [2022-02-20 18:31:17,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {844#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {844#false} is VALID [2022-02-20 18:31:17,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {844#false} assume !(node5_~m5~0#1 != ~nomsg~0); {844#false} is VALID [2022-02-20 18:31:17,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {844#false} ~mode5~0 := 0; {844#false} is VALID [2022-02-20 18:31:17,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {844#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {844#false} is VALID [2022-02-20 18:31:17,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {844#false} assume !(node6_~m6~0#1 != ~nomsg~0); {844#false} is VALID [2022-02-20 18:31:17,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {844#false} ~mode6~0 := 0; {844#false} is VALID [2022-02-20 18:31:17,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {844#false} assume !(0 != ~mode7~0 % 256); {844#false} is VALID [2022-02-20 18:31:17,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {844#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {844#false} is VALID [2022-02-20 18:31:17,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {844#false} ~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; {844#false} is VALID [2022-02-20 18:31:17,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {844#false} assume !(0 != ~mode8~0 % 256); {844#false} is VALID [2022-02-20 18:31:17,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {844#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {844#false} is VALID [2022-02-20 18:31:17,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {844#false} ~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; {844#false} is VALID [2022-02-20 18:31:17,032 INFO L290 TraceCheckUtils]: 39: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {844#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {844#false} is VALID [2022-02-20 18:31:17,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {844#false} check_#res#1 := check_~tmp~1#1; {844#false} is VALID [2022-02-20 18:31:17,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {844#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; {844#false} is VALID [2022-02-20 18:31:17,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {844#false} assume 0 == assert_~arg#1 % 256; {844#false} is VALID [2022-02-20 18:31:17,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-02-20 18:31:17,034 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:17,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:17,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464044767] [2022-02-20 18:31:17,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464044767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:17,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:17,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:17,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616118578] [2022-02-20 18:31:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:17,036 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:31:17,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:17,037 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:31:17,067 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:31:17,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:17,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:17,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:17,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:17,069 INFO L87 Difference]: Start difference. First operand 143 states and 249 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:31:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:17,560 INFO L93 Difference]: Finished difference Result 223 states and 374 transitions. [2022-02-20 18:31:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:31:17,560 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:31:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:17,561 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:31:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-02-20 18:31:17,565 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:31:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-02-20 18:31:17,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 374 transitions. [2022-02-20 18:31:17,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:17,835 INFO L225 Difference]: With dead ends: 223 [2022-02-20 18:31:17,836 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 18:31:17,836 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:31:17,837 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 924 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:31:17,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 924 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 18:31:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-20 18:31:17,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:17,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:17,846 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:17,846 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:17,850 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2022-02-20 18:31:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2022-02-20 18:31:17,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:17,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:17,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:31:17,852 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:31:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:17,856 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2022-02-20 18:31:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2022-02-20 18:31:17,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:17,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:17,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:17,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:17,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 188 transitions. [2022-02-20 18:31:17,861 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 188 transitions. Word has length 45 [2022-02-20 18:31:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:17,862 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 188 transitions. [2022-02-20 18:31:17,862 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:31:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2022-02-20 18:31:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:17,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:17,864 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:17,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:31:17,865 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:17,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1176555156, now seen corresponding path program 1 times [2022-02-20 18:31:17,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:17,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402172432] [2022-02-20 18:31:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:18,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {1542#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(41, 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]; {1542#true} is VALID [2022-02-20 18:31:18,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1542#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; {1542#true} is VALID [2022-02-20 18:31:18,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#true} assume 0 == ~r1~0 % 256; {1542#true} is VALID [2022-02-20 18:31:18,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {1542#true} assume ~id1~0 >= 0; {1542#true} is VALID [2022-02-20 18:31:18,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {1542#true} assume 0 == ~st1~0; {1542#true} is VALID [2022-02-20 18:31:18,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#true} assume ~send1~0 == ~id1~0; {1542#true} is VALID [2022-02-20 18:31:18,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1542#true} assume 0 == ~mode1~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,076 INFO L290 TraceCheckUtils]: 65: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,076 INFO L290 TraceCheckUtils]: 66: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:31:18,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {1544#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {1543#false} is VALID [2022-02-20 18:31:18,078 INFO L290 TraceCheckUtils]: 69: Hoare triple {1543#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1543#false} is VALID [2022-02-20 18:31:18,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {1543#false} ~mode1~0 := 0; {1543#false} is VALID [2022-02-20 18:31:18,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {1543#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1543#false} is VALID [2022-02-20 18:31:18,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {1543#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1543#false} is VALID [2022-02-20 18:31:18,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {1543#false} ~mode2~0 := 0; {1543#false} is VALID [2022-02-20 18:31:18,079 INFO L290 TraceCheckUtils]: 75: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {1543#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1543#false} is VALID [2022-02-20 18:31:18,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {1543#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1543#false} is VALID [2022-02-20 18:31:18,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {1543#false} ~mode3~0 := 0; {1543#false} is VALID [2022-02-20 18:31:18,081 INFO L290 TraceCheckUtils]: 79: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,081 INFO L290 TraceCheckUtils]: 80: Hoare triple {1543#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1543#false} is VALID [2022-02-20 18:31:18,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {1543#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1543#false} is VALID [2022-02-20 18:31:18,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {1543#false} ~mode4~0 := 0; {1543#false} is VALID [2022-02-20 18:31:18,081 INFO L290 TraceCheckUtils]: 83: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {1543#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1543#false} is VALID [2022-02-20 18:31:18,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {1543#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1543#false} is VALID [2022-02-20 18:31:18,082 INFO L290 TraceCheckUtils]: 86: Hoare triple {1543#false} ~mode5~0 := 0; {1543#false} is VALID [2022-02-20 18:31:18,082 INFO L290 TraceCheckUtils]: 87: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,082 INFO L290 TraceCheckUtils]: 88: Hoare triple {1543#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1543#false} is VALID [2022-02-20 18:31:18,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {1543#false} assume !(node6_~m6~0#1 != ~nomsg~0); {1543#false} is VALID [2022-02-20 18:31:18,083 INFO L290 TraceCheckUtils]: 90: Hoare triple {1543#false} ~mode6~0 := 0; {1543#false} is VALID [2022-02-20 18:31:18,083 INFO L290 TraceCheckUtils]: 91: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {1543#false} assume !(0 != ~mode7~0 % 256); {1543#false} is VALID [2022-02-20 18:31:18,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {1543#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {1543#false} is VALID [2022-02-20 18:31:18,084 INFO L290 TraceCheckUtils]: 94: Hoare triple {1543#false} ~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; {1543#false} is VALID [2022-02-20 18:31:18,084 INFO L290 TraceCheckUtils]: 95: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {1543#false} assume !(0 != ~mode8~0 % 256); {1543#false} is VALID [2022-02-20 18:31:18,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {1543#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {1543#false} is VALID [2022-02-20 18:31:18,084 INFO L290 TraceCheckUtils]: 98: Hoare triple {1543#false} ~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; {1543#false} is VALID [2022-02-20 18:31:18,085 INFO L290 TraceCheckUtils]: 99: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,085 INFO L290 TraceCheckUtils]: 100: Hoare triple {1543#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {1543#false} is VALID [2022-02-20 18:31:18,085 INFO L290 TraceCheckUtils]: 101: Hoare triple {1543#false} check_#res#1 := check_~tmp~1#1; {1543#false} is VALID [2022-02-20 18:31:18,085 INFO L290 TraceCheckUtils]: 102: Hoare triple {1543#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; {1543#false} is VALID [2022-02-20 18:31:18,086 INFO L290 TraceCheckUtils]: 103: Hoare triple {1543#false} assume 0 == assert_~arg#1 % 256; {1543#false} is VALID [2022-02-20 18:31:18,086 INFO L290 TraceCheckUtils]: 104: Hoare triple {1543#false} assume !false; {1543#false} is VALID [2022-02-20 18:31:18,087 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:18,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:18,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402172432] [2022-02-20 18:31:18,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402172432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:18,088 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:18,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:18,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294482048] [2022-02-20 18:31:18,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:18,089 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:18,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:18,090 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:18,163 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:18,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:18,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:18,166 INFO L87 Difference]: Start difference. First operand 143 states and 188 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:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:18,409 INFO L93 Difference]: Finished difference Result 289 states and 420 transitions. [2022-02-20 18:31:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:18,410 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:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:18,412 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:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:18,416 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:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:18,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:18,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:18,760 INFO L225 Difference]: With dead ends: 289 [2022-02-20 18:31:18,760 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 18:31:18,761 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:18,767 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 111 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 414 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:18,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 414 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:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 18:31:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2022-02-20 18:31:18,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:18,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call 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:18,789 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call 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:18,790 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call 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:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:18,796 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-02-20 18:31:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2022-02-20 18:31:18,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:18,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:18,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:31:18,799 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 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 213 states. [2022-02-20 18:31:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:18,805 INFO L93 Difference]: Finished difference Result 213 states and 298 transitions. [2022-02-20 18:31:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2022-02-20 18:31:18,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:18,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:18,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:18,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 210 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call 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:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 297 transitions. [2022-02-20 18:31:18,813 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 297 transitions. Word has length 105 [2022-02-20 18:31:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:18,813 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 297 transitions. [2022-02-20 18:31:18,814 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:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 297 transitions. [2022-02-20 18:31:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:18,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:18,815 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:18,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:31:18,816 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1701405430, now seen corresponding path program 1 times [2022-02-20 18:31:18,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:18,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173025546] [2022-02-20 18:31:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:18,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {2530#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(41, 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]; {2530#true} is VALID [2022-02-20 18:31:18,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {2530#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; {2530#true} is VALID [2022-02-20 18:31:18,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {2530#true} assume 0 == ~r1~0 % 256; {2530#true} is VALID [2022-02-20 18:31:18,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {2530#true} assume ~id1~0 >= 0; {2530#true} is VALID [2022-02-20 18:31:18,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {2530#true} assume 0 == ~st1~0; {2530#true} is VALID [2022-02-20 18:31:18,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {2530#true} assume ~send1~0 == ~id1~0; {2530#true} is VALID [2022-02-20 18:31:18,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {2530#true} assume 0 == ~mode1~0 % 256; {2530#true} is VALID [2022-02-20 18:31:18,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {2530#true} assume ~id2~0 >= 0; {2530#true} is VALID [2022-02-20 18:31:18,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {2530#true} assume 0 == ~st2~0; {2530#true} is VALID [2022-02-20 18:31:18,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {2530#true} assume ~send2~0 == ~id2~0; {2530#true} is VALID [2022-02-20 18:31:18,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {2530#true} assume 0 == ~mode2~0 % 256; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,953 INFO L290 TraceCheckUtils]: 51: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,959 INFO L290 TraceCheckUtils]: 55: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,962 INFO L290 TraceCheckUtils]: 59: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,962 INFO L290 TraceCheckUtils]: 60: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,963 INFO L290 TraceCheckUtils]: 61: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,963 INFO L290 TraceCheckUtils]: 62: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,964 INFO L290 TraceCheckUtils]: 64: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,965 INFO L290 TraceCheckUtils]: 65: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,965 INFO L290 TraceCheckUtils]: 66: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:31:18,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {2532#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2531#false} is VALID [2022-02-20 18:31:18,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {2531#false} assume !(node2_~m2~0#1 != ~nomsg~0); {2531#false} is VALID [2022-02-20 18:31:18,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {2531#false} ~mode2~0 := 0; {2531#false} is VALID [2022-02-20 18:31:18,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,970 INFO L290 TraceCheckUtils]: 76: Hoare triple {2531#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2531#false} is VALID [2022-02-20 18:31:18,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {2531#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2531#false} is VALID [2022-02-20 18:31:18,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {2531#false} ~mode3~0 := 0; {2531#false} is VALID [2022-02-20 18:31:18,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {2531#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2531#false} is VALID [2022-02-20 18:31:18,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {2531#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2531#false} is VALID [2022-02-20 18:31:18,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {2531#false} ~mode4~0 := 0; {2531#false} is VALID [2022-02-20 18:31:18,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {2531#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2531#false} is VALID [2022-02-20 18:31:18,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {2531#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2531#false} is VALID [2022-02-20 18:31:18,971 INFO L290 TraceCheckUtils]: 86: Hoare triple {2531#false} ~mode5~0 := 0; {2531#false} is VALID [2022-02-20 18:31:18,971 INFO L290 TraceCheckUtils]: 87: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,971 INFO L290 TraceCheckUtils]: 88: Hoare triple {2531#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2531#false} is VALID [2022-02-20 18:31:18,972 INFO L290 TraceCheckUtils]: 89: Hoare triple {2531#false} assume !(node6_~m6~0#1 != ~nomsg~0); {2531#false} is VALID [2022-02-20 18:31:18,972 INFO L290 TraceCheckUtils]: 90: Hoare triple {2531#false} ~mode6~0 := 0; {2531#false} is VALID [2022-02-20 18:31:18,972 INFO L290 TraceCheckUtils]: 91: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,972 INFO L290 TraceCheckUtils]: 92: Hoare triple {2531#false} assume !(0 != ~mode7~0 % 256); {2531#false} is VALID [2022-02-20 18:31:18,972 INFO L290 TraceCheckUtils]: 93: Hoare triple {2531#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {2531#false} is VALID [2022-02-20 18:31:18,972 INFO L290 TraceCheckUtils]: 94: Hoare triple {2531#false} ~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; {2531#false} is VALID [2022-02-20 18:31:18,973 INFO L290 TraceCheckUtils]: 95: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,973 INFO L290 TraceCheckUtils]: 96: Hoare triple {2531#false} assume !(0 != ~mode8~0 % 256); {2531#false} is VALID [2022-02-20 18:31:18,973 INFO L290 TraceCheckUtils]: 97: Hoare triple {2531#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {2531#false} is VALID [2022-02-20 18:31:18,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {2531#false} ~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; {2531#false} is VALID [2022-02-20 18:31:18,973 INFO L290 TraceCheckUtils]: 99: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,973 INFO L290 TraceCheckUtils]: 100: Hoare triple {2531#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {2531#false} is VALID [2022-02-20 18:31:18,973 INFO L290 TraceCheckUtils]: 101: Hoare triple {2531#false} check_#res#1 := check_~tmp~1#1; {2531#false} is VALID [2022-02-20 18:31:18,974 INFO L290 TraceCheckUtils]: 102: Hoare triple {2531#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; {2531#false} is VALID [2022-02-20 18:31:18,974 INFO L290 TraceCheckUtils]: 103: Hoare triple {2531#false} assume 0 == assert_~arg#1 % 256; {2531#false} is VALID [2022-02-20 18:31:18,974 INFO L290 TraceCheckUtils]: 104: Hoare triple {2531#false} assume !false; {2531#false} is VALID [2022-02-20 18:31:18,975 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:18,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:18,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173025546] [2022-02-20 18:31:18,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173025546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:18,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:18,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:18,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6197088] [2022-02-20 18:31:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:18,976 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:18,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:18,977 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:19,058 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:19,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:19,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:19,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:19,059 INFO L87 Difference]: Start difference. First operand 211 states and 297 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:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:19,333 INFO L93 Difference]: Finished difference Result 487 states and 737 transitions. [2022-02-20 18:31:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:19,334 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:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:19,334 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:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:19,338 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:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:19,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:19,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:19,674 INFO L225 Difference]: With dead ends: 487 [2022-02-20 18:31:19,675 INFO L226 Difference]: Without dead ends: 343 [2022-02-20 18:31:19,675 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:19,676 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 107 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 413 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:19,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 413 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:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-02-20 18:31:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-02-20 18:31:19,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:19,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call 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:19,692 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call 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:19,693 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call 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:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:19,704 INFO L93 Difference]: Finished difference Result 343 states and 505 transitions. [2022-02-20 18:31:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 505 transitions. [2022-02-20 18:31:19,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:19,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:19,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 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 343 states. [2022-02-20 18:31:19,707 INFO L87 Difference]: Start difference. First operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 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 343 states. [2022-02-20 18:31:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:19,718 INFO L93 Difference]: Finished difference Result 343 states and 505 transitions. [2022-02-20 18:31:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 505 transitions. [2022-02-20 18:31:19,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:19,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:19,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:19,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.4823529411764707) internal successors, (504), 340 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call 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:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 504 transitions. [2022-02-20 18:31:19,730 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 504 transitions. Word has length 105 [2022-02-20 18:31:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:19,730 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 504 transitions. [2022-02-20 18:31:19,731 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:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 504 transitions. [2022-02-20 18:31:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:19,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:19,732 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:19,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:31:19,732 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash -179136962, now seen corresponding path program 1 times [2022-02-20 18:31:19,733 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:19,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240374823] [2022-02-20 18:31:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:19,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {4161#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(41, 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]; {4161#true} is VALID [2022-02-20 18:31:19,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {4161#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; {4161#true} is VALID [2022-02-20 18:31:19,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {4161#true} assume 0 == ~r1~0 % 256; {4161#true} is VALID [2022-02-20 18:31:19,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {4161#true} assume ~id1~0 >= 0; {4161#true} is VALID [2022-02-20 18:31:19,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {4161#true} assume 0 == ~st1~0; {4161#true} is VALID [2022-02-20 18:31:19,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {4161#true} assume ~send1~0 == ~id1~0; {4161#true} is VALID [2022-02-20 18:31:19,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {4161#true} assume 0 == ~mode1~0 % 256; {4161#true} is VALID [2022-02-20 18:31:19,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {4161#true} assume ~id2~0 >= 0; {4161#true} is VALID [2022-02-20 18:31:19,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {4161#true} assume 0 == ~st2~0; {4161#true} is VALID [2022-02-20 18:31:19,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {4161#true} assume ~send2~0 == ~id2~0; {4161#true} is VALID [2022-02-20 18:31:19,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {4161#true} assume 0 == ~mode2~0 % 256; {4161#true} is VALID [2022-02-20 18:31:19,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {4161#true} assume ~id3~0 >= 0; {4161#true} is VALID [2022-02-20 18:31:19,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {4161#true} assume 0 == ~st3~0; {4161#true} is VALID [2022-02-20 18:31:19,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {4161#true} assume ~send3~0 == ~id3~0; {4161#true} is VALID [2022-02-20 18:31:19,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {4161#true} assume 0 == ~mode3~0 % 256; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,859 INFO L290 TraceCheckUtils]: 50: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,865 INFO L290 TraceCheckUtils]: 63: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,865 INFO L290 TraceCheckUtils]: 64: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,868 INFO L290 TraceCheckUtils]: 69: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,868 INFO L290 TraceCheckUtils]: 70: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,869 INFO L290 TraceCheckUtils]: 71: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,869 INFO L290 TraceCheckUtils]: 72: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,870 INFO L290 TraceCheckUtils]: 73: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,870 INFO L290 TraceCheckUtils]: 74: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:31:19,871 INFO L290 TraceCheckUtils]: 76: Hoare triple {4163#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4162#false} is VALID [2022-02-20 18:31:19,871 INFO L290 TraceCheckUtils]: 77: Hoare triple {4162#false} assume !(node3_~m3~0#1 != ~nomsg~0); {4162#false} is VALID [2022-02-20 18:31:19,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {4162#false} ~mode3~0 := 0; {4162#false} is VALID [2022-02-20 18:31:19,872 INFO L290 TraceCheckUtils]: 79: Hoare triple {4162#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; {4162#false} is VALID [2022-02-20 18:31:19,872 INFO L290 TraceCheckUtils]: 80: Hoare triple {4162#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4162#false} is VALID [2022-02-20 18:31:19,872 INFO L290 TraceCheckUtils]: 81: Hoare triple {4162#false} assume !(node4_~m4~0#1 != ~nomsg~0); {4162#false} is VALID [2022-02-20 18:31:19,872 INFO L290 TraceCheckUtils]: 82: Hoare triple {4162#false} ~mode4~0 := 0; {4162#false} is VALID [2022-02-20 18:31:19,872 INFO L290 TraceCheckUtils]: 83: Hoare triple {4162#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; {4162#false} is VALID [2022-02-20 18:31:19,872 INFO L290 TraceCheckUtils]: 84: Hoare triple {4162#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4162#false} is VALID [2022-02-20 18:31:19,873 INFO L290 TraceCheckUtils]: 85: Hoare triple {4162#false} assume !(node5_~m5~0#1 != ~nomsg~0); {4162#false} is VALID [2022-02-20 18:31:19,873 INFO L290 TraceCheckUtils]: 86: Hoare triple {4162#false} ~mode5~0 := 0; {4162#false} is VALID [2022-02-20 18:31:19,873 INFO L290 TraceCheckUtils]: 87: Hoare triple {4162#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; {4162#false} is VALID [2022-02-20 18:31:19,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {4162#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {4162#false} is VALID [2022-02-20 18:31:19,873 INFO L290 TraceCheckUtils]: 89: Hoare triple {4162#false} assume !(node6_~m6~0#1 != ~nomsg~0); {4162#false} is VALID [2022-02-20 18:31:19,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {4162#false} ~mode6~0 := 0; {4162#false} is VALID [2022-02-20 18:31:19,873 INFO L290 TraceCheckUtils]: 91: Hoare triple {4162#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; {4162#false} is VALID [2022-02-20 18:31:19,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {4162#false} assume !(0 != ~mode7~0 % 256); {4162#false} is VALID [2022-02-20 18:31:19,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {4162#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {4162#false} is VALID [2022-02-20 18:31:19,874 INFO L290 TraceCheckUtils]: 94: Hoare triple {4162#false} ~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; {4162#false} is VALID [2022-02-20 18:31:19,874 INFO L290 TraceCheckUtils]: 95: Hoare triple {4162#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; {4162#false} is VALID [2022-02-20 18:31:19,874 INFO L290 TraceCheckUtils]: 96: Hoare triple {4162#false} assume !(0 != ~mode8~0 % 256); {4162#false} is VALID [2022-02-20 18:31:19,875 INFO L290 TraceCheckUtils]: 97: Hoare triple {4162#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {4162#false} is VALID [2022-02-20 18:31:19,875 INFO L290 TraceCheckUtils]: 98: Hoare triple {4162#false} ~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; {4162#false} is VALID [2022-02-20 18:31:19,875 INFO L290 TraceCheckUtils]: 99: Hoare triple {4162#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; {4162#false} is VALID [2022-02-20 18:31:19,875 INFO L290 TraceCheckUtils]: 100: Hoare triple {4162#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {4162#false} is VALID [2022-02-20 18:31:19,875 INFO L290 TraceCheckUtils]: 101: Hoare triple {4162#false} check_#res#1 := check_~tmp~1#1; {4162#false} is VALID [2022-02-20 18:31:19,875 INFO L290 TraceCheckUtils]: 102: Hoare triple {4162#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; {4162#false} is VALID [2022-02-20 18:31:19,876 INFO L290 TraceCheckUtils]: 103: Hoare triple {4162#false} assume 0 == assert_~arg#1 % 256; {4162#false} is VALID [2022-02-20 18:31:19,876 INFO L290 TraceCheckUtils]: 104: Hoare triple {4162#false} assume !false; {4162#false} is VALID [2022-02-20 18:31:19,876 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:19,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:19,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240374823] [2022-02-20 18:31:19,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240374823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:19,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:19,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:19,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971369117] [2022-02-20 18:31:19,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:19,878 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:19,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:19,878 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:19,949 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:19,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:19,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:19,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:19,950 INFO L87 Difference]: Start difference. First operand 341 states and 504 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:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:20,254 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2022-02-20 18:31:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:20,255 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:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:20,255 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:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:20,258 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:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:20,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:20,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:20,582 INFO L225 Difference]: With dead ends: 865 [2022-02-20 18:31:20,582 INFO L226 Difference]: Without dead ends: 591 [2022-02-20 18:31:20,585 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:20,589 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 103 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 412 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:20,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 412 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:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-02-20 18:31:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2022-02-20 18:31:20,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:20,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call 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:20,616 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call 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:20,617 INFO L87 Difference]: Start difference. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call 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:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:20,637 INFO L93 Difference]: Finished difference Result 591 states and 897 transitions. [2022-02-20 18:31:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 897 transitions. [2022-02-20 18:31:20,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:20,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:20,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:31:20,641 INFO L87 Difference]: Start difference. First operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:31:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:20,660 INFO L93 Difference]: Finished difference Result 591 states and 897 transitions. [2022-02-20 18:31:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 897 transitions. [2022-02-20 18:31:20,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:20,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:20,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:20,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.5238095238095237) internal successors, (896), 588 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call 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:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 896 transitions. [2022-02-20 18:31:20,684 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 896 transitions. Word has length 105 [2022-02-20 18:31:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:20,684 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 896 transitions. [2022-02-20 18:31:20,684 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:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 896 transitions. [2022-02-20 18:31:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:20,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:20,687 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:20,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:31:20,688 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1430042254, now seen corresponding path program 1 times [2022-02-20 18:31:20,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:20,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66617897] [2022-02-20 18:31:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:20,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {7024#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(41, 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]; {7024#true} is VALID [2022-02-20 18:31:20,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {7024#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; {7024#true} is VALID [2022-02-20 18:31:20,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {7024#true} assume 0 == ~r1~0 % 256; {7024#true} is VALID [2022-02-20 18:31:20,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {7024#true} assume ~id1~0 >= 0; {7024#true} is VALID [2022-02-20 18:31:20,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {7024#true} assume 0 == ~st1~0; {7024#true} is VALID [2022-02-20 18:31:20,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {7024#true} assume ~send1~0 == ~id1~0; {7024#true} is VALID [2022-02-20 18:31:20,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {7024#true} assume 0 == ~mode1~0 % 256; {7024#true} is VALID [2022-02-20 18:31:20,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {7024#true} assume ~id2~0 >= 0; {7024#true} is VALID [2022-02-20 18:31:20,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {7024#true} assume 0 == ~st2~0; {7024#true} is VALID [2022-02-20 18:31:20,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {7024#true} assume ~send2~0 == ~id2~0; {7024#true} is VALID [2022-02-20 18:31:20,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {7024#true} assume 0 == ~mode2~0 % 256; {7024#true} is VALID [2022-02-20 18:31:20,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {7024#true} assume ~id3~0 >= 0; {7024#true} is VALID [2022-02-20 18:31:20,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {7024#true} assume 0 == ~st3~0; {7024#true} is VALID [2022-02-20 18:31:20,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {7024#true} assume ~send3~0 == ~id3~0; {7024#true} is VALID [2022-02-20 18:31:20,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {7024#true} assume 0 == ~mode3~0 % 256; {7024#true} is VALID [2022-02-20 18:31:20,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {7024#true} assume ~id4~0 >= 0; {7024#true} is VALID [2022-02-20 18:31:20,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {7024#true} assume 0 == ~st4~0; {7024#true} is VALID [2022-02-20 18:31:20,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {7024#true} assume ~send4~0 == ~id4~0; {7024#true} is VALID [2022-02-20 18:31:20,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {7024#true} assume 0 == ~mode4~0 % 256; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,841 INFO L290 TraceCheckUtils]: 55: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,843 INFO L290 TraceCheckUtils]: 61: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,844 INFO L290 TraceCheckUtils]: 62: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,846 INFO L290 TraceCheckUtils]: 67: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,846 INFO L290 TraceCheckUtils]: 68: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,847 INFO L290 TraceCheckUtils]: 71: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,847 INFO L290 TraceCheckUtils]: 72: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,848 INFO L290 TraceCheckUtils]: 75: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,849 INFO L290 TraceCheckUtils]: 76: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,849 INFO L290 TraceCheckUtils]: 77: Hoare triple {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,850 INFO L290 TraceCheckUtils]: 79: Hoare triple {7026#(= (+ (* (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; {7026#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:31:20,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {7026#(= (+ (* (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; {7025#false} is VALID [2022-02-20 18:31:20,857 INFO L290 TraceCheckUtils]: 81: Hoare triple {7025#false} assume !(node4_~m4~0#1 != ~nomsg~0); {7025#false} is VALID [2022-02-20 18:31:20,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {7025#false} ~mode4~0 := 0; {7025#false} is VALID [2022-02-20 18:31:20,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {7025#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; {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 84: Hoare triple {7025#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {7025#false} assume !(node5_~m5~0#1 != ~nomsg~0); {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 86: Hoare triple {7025#false} ~mode5~0 := 0; {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 87: Hoare triple {7025#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; {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {7025#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {7025#false} assume !(node6_~m6~0#1 != ~nomsg~0); {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {7025#false} ~mode6~0 := 0; {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 91: Hoare triple {7025#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; {7025#false} is VALID [2022-02-20 18:31:20,858 INFO L290 TraceCheckUtils]: 92: Hoare triple {7025#false} assume !(0 != ~mode7~0 % 256); {7025#false} is VALID [2022-02-20 18:31:20,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {7025#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {7025#false} is VALID [2022-02-20 18:31:20,859 INFO L290 TraceCheckUtils]: 94: Hoare triple {7025#false} ~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; {7025#false} is VALID [2022-02-20 18:31:20,859 INFO L290 TraceCheckUtils]: 95: Hoare triple {7025#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; {7025#false} is VALID [2022-02-20 18:31:20,859 INFO L290 TraceCheckUtils]: 96: Hoare triple {7025#false} assume !(0 != ~mode8~0 % 256); {7025#false} is VALID [2022-02-20 18:31:20,859 INFO L290 TraceCheckUtils]: 97: Hoare triple {7025#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {7025#false} is VALID [2022-02-20 18:31:20,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {7025#false} ~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; {7025#false} is VALID [2022-02-20 18:31:20,860 INFO L290 TraceCheckUtils]: 99: Hoare triple {7025#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; {7025#false} is VALID [2022-02-20 18:31:20,860 INFO L290 TraceCheckUtils]: 100: Hoare triple {7025#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {7025#false} is VALID [2022-02-20 18:31:20,860 INFO L290 TraceCheckUtils]: 101: Hoare triple {7025#false} check_#res#1 := check_~tmp~1#1; {7025#false} is VALID [2022-02-20 18:31:20,860 INFO L290 TraceCheckUtils]: 102: Hoare triple {7025#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; {7025#false} is VALID [2022-02-20 18:31:20,860 INFO L290 TraceCheckUtils]: 103: Hoare triple {7025#false} assume 0 == assert_~arg#1 % 256; {7025#false} is VALID [2022-02-20 18:31:20,860 INFO L290 TraceCheckUtils]: 104: Hoare triple {7025#false} assume !false; {7025#false} is VALID [2022-02-20 18:31:20,861 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:20,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:20,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66617897] [2022-02-20 18:31:20,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66617897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:20,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:20,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:20,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752794786] [2022-02-20 18:31:20,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:20,863 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:20,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:20,863 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:20,945 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:20,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:20,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:20,949 INFO L87 Difference]: Start difference. First operand 589 states and 896 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:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,322 INFO L93 Difference]: Finished difference Result 1585 states and 2474 transitions. [2022-02-20 18:31:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:21,322 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:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:21,323 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:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:21,326 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:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:21,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:21,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:21,692 INFO L225 Difference]: With dead ends: 1585 [2022-02-20 18:31:21,693 INFO L226 Difference]: Without dead ends: 1063 [2022-02-20 18:31:21,694 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:21,695 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 99 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 411 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:21,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 411 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:21,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-02-20 18:31:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2022-02-20 18:31:21,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:21,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call 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:21,742 INFO L74 IsIncluded]: Start isIncluded. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call 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:21,744 INFO L87 Difference]: Start difference. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call 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:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,789 INFO L93 Difference]: Finished difference Result 1063 states and 1637 transitions. [2022-02-20 18:31:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1637 transitions. [2022-02-20 18:31:21,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:21,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:21,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 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 1063 states. [2022-02-20 18:31:21,795 INFO L87 Difference]: Start difference. First operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 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 1063 states. [2022-02-20 18:31:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:21,846 INFO L93 Difference]: Finished difference Result 1063 states and 1637 transitions. [2022-02-20 18:31:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1637 transitions. [2022-02-20 18:31:21,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:21,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:21,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:21,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.5433962264150944) internal successors, (1636), 1060 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call 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:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1636 transitions. [2022-02-20 18:31:21,910 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1636 transitions. Word has length 105 [2022-02-20 18:31:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:21,911 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1636 transitions. [2022-02-20 18:31:21,911 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:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1636 transitions. [2022-02-20 18:31:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:21,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:21,912 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:21,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:31:21,912 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2119342312, now seen corresponding path program 1 times [2022-02-20 18:31:21,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:21,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187543437] [2022-02-20 18:31:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:21,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {12243#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(41, 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]; {12243#true} is VALID [2022-02-20 18:31:21,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {12243#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; {12243#true} is VALID [2022-02-20 18:31:21,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {12243#true} assume 0 == ~r1~0 % 256; {12243#true} is VALID [2022-02-20 18:31:21,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {12243#true} assume ~id1~0 >= 0; {12243#true} is VALID [2022-02-20 18:31:21,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {12243#true} assume 0 == ~st1~0; {12243#true} is VALID [2022-02-20 18:31:21,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {12243#true} assume ~send1~0 == ~id1~0; {12243#true} is VALID [2022-02-20 18:31:21,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {12243#true} assume 0 == ~mode1~0 % 256; {12243#true} is VALID [2022-02-20 18:31:21,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {12243#true} assume ~id2~0 >= 0; {12243#true} is VALID [2022-02-20 18:31:21,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {12243#true} assume 0 == ~st2~0; {12243#true} is VALID [2022-02-20 18:31:21,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {12243#true} assume ~send2~0 == ~id2~0; {12243#true} is VALID [2022-02-20 18:31:21,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {12243#true} assume 0 == ~mode2~0 % 256; {12243#true} is VALID [2022-02-20 18:31:21,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {12243#true} assume ~id3~0 >= 0; {12243#true} is VALID [2022-02-20 18:31:21,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {12243#true} assume 0 == ~st3~0; {12243#true} is VALID [2022-02-20 18:31:21,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {12243#true} assume ~send3~0 == ~id3~0; {12243#true} is VALID [2022-02-20 18:31:21,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {12243#true} assume 0 == ~mode3~0 % 256; {12243#true} is VALID [2022-02-20 18:31:21,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {12243#true} assume ~id4~0 >= 0; {12243#true} is VALID [2022-02-20 18:31:21,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {12243#true} assume 0 == ~st4~0; {12243#true} is VALID [2022-02-20 18:31:21,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {12243#true} assume ~send4~0 == ~id4~0; {12243#true} is VALID [2022-02-20 18:31:21,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {12243#true} assume 0 == ~mode4~0 % 256; {12243#true} is VALID [2022-02-20 18:31:21,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {12243#true} assume ~id5~0 >= 0; {12243#true} is VALID [2022-02-20 18:31:21,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {12243#true} assume 0 == ~st5~0; {12243#true} is VALID [2022-02-20 18:31:21,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {12243#true} assume ~send5~0 == ~id5~0; {12243#true} is VALID [2022-02-20 18:31:22,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {12243#true} assume 0 == ~mode5~0 % 256; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,015 INFO L290 TraceCheckUtils]: 59: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,021 INFO L290 TraceCheckUtils]: 72: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,021 INFO L290 TraceCheckUtils]: 73: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,021 INFO L290 TraceCheckUtils]: 74: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,023 INFO L290 TraceCheckUtils]: 78: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,024 INFO L290 TraceCheckUtils]: 79: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,024 INFO L290 TraceCheckUtils]: 80: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,024 INFO L290 TraceCheckUtils]: 81: Hoare triple {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,025 INFO L290 TraceCheckUtils]: 82: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,025 INFO L290 TraceCheckUtils]: 83: Hoare triple {12245#(= (+ (* (- 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; {12245#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:31:22,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {12245#(= (+ (* (- 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; {12244#false} is VALID [2022-02-20 18:31:22,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {12244#false} assume !(node5_~m5~0#1 != ~nomsg~0); {12244#false} is VALID [2022-02-20 18:31:22,026 INFO L290 TraceCheckUtils]: 86: Hoare triple {12244#false} ~mode5~0 := 0; {12244#false} is VALID [2022-02-20 18:31:22,026 INFO L290 TraceCheckUtils]: 87: Hoare triple {12244#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; {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 88: Hoare triple {12244#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 89: Hoare triple {12244#false} assume !(node6_~m6~0#1 != ~nomsg~0); {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 90: Hoare triple {12244#false} ~mode6~0 := 0; {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 91: Hoare triple {12244#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; {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 92: Hoare triple {12244#false} assume !(0 != ~mode7~0 % 256); {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 93: Hoare triple {12244#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 94: Hoare triple {12244#false} ~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; {12244#false} is VALID [2022-02-20 18:31:22,027 INFO L290 TraceCheckUtils]: 95: Hoare triple {12244#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; {12244#false} is VALID [2022-02-20 18:31:22,028 INFO L290 TraceCheckUtils]: 96: Hoare triple {12244#false} assume !(0 != ~mode8~0 % 256); {12244#false} is VALID [2022-02-20 18:31:22,028 INFO L290 TraceCheckUtils]: 97: Hoare triple {12244#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {12244#false} is VALID [2022-02-20 18:31:22,028 INFO L290 TraceCheckUtils]: 98: Hoare triple {12244#false} ~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; {12244#false} is VALID [2022-02-20 18:31:22,028 INFO L290 TraceCheckUtils]: 99: Hoare triple {12244#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; {12244#false} is VALID [2022-02-20 18:31:22,028 INFO L290 TraceCheckUtils]: 100: Hoare triple {12244#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {12244#false} is VALID [2022-02-20 18:31:22,028 INFO L290 TraceCheckUtils]: 101: Hoare triple {12244#false} check_#res#1 := check_~tmp~1#1; {12244#false} is VALID [2022-02-20 18:31:22,028 INFO L290 TraceCheckUtils]: 102: Hoare triple {12244#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; {12244#false} is VALID [2022-02-20 18:31:22,029 INFO L290 TraceCheckUtils]: 103: Hoare triple {12244#false} assume 0 == assert_~arg#1 % 256; {12244#false} is VALID [2022-02-20 18:31:22,029 INFO L290 TraceCheckUtils]: 104: Hoare triple {12244#false} assume !false; {12244#false} is VALID [2022-02-20 18:31:22,029 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:22,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:22,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187543437] [2022-02-20 18:31:22,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187543437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:22,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:22,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:22,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095446877] [2022-02-20 18:31:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:22,031 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:22,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:22,031 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:22,103 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:22,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:22,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:22,104 INFO L87 Difference]: Start difference. First operand 1061 states and 1636 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:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:22,646 INFO L93 Difference]: Finished difference Result 2953 states and 4614 transitions. [2022-02-20 18:31:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:22,646 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:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:22,646 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:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:22,649 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:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:22,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:22,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:23,125 INFO L225 Difference]: With dead ends: 2953 [2022-02-20 18:31:23,125 INFO L226 Difference]: Without dead ends: 1959 [2022-02-20 18:31:23,126 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:23,126 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 95 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 410 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:23,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 410 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:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2022-02-20 18:31:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1957. [2022-02-20 18:31:23,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:23,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1959 states. Second operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call 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:23,203 INFO L74 IsIncluded]: Start isIncluded. First operand 1959 states. Second operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call 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:23,206 INFO L87 Difference]: Start difference. First operand 1959 states. Second operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call 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:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:23,366 INFO L93 Difference]: Finished difference Result 1959 states and 3029 transitions. [2022-02-20 18:31:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3029 transitions. [2022-02-20 18:31:23,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:23,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:23,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 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 1959 states. [2022-02-20 18:31:23,390 INFO L87 Difference]: Start difference. First operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 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 1959 states. [2022-02-20 18:31:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:23,569 INFO L93 Difference]: Finished difference Result 1959 states and 3029 transitions. [2022-02-20 18:31:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3029 transitions. [2022-02-20 18:31:23,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:23,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:23,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:23,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1956 states have (on average 1.5480572597137015) internal successors, (3028), 1956 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call 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:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3028 transitions. [2022-02-20 18:31:23,742 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3028 transitions. Word has length 105 [2022-02-20 18:31:23,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:23,742 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 3028 transitions. [2022-02-20 18:31:23,742 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:23,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3028 transitions. [2022-02-20 18:31:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:23,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:23,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:31:23,744 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 179311454, now seen corresponding path program 1 times [2022-02-20 18:31:23,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:23,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796900407] [2022-02-20 18:31:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:23,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {21958#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(41, 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]; {21958#true} is VALID [2022-02-20 18:31:23,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {21958#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; {21958#true} is VALID [2022-02-20 18:31:23,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {21958#true} assume 0 == ~r1~0 % 256; {21958#true} is VALID [2022-02-20 18:31:23,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {21958#true} assume ~id1~0 >= 0; {21958#true} is VALID [2022-02-20 18:31:23,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {21958#true} assume 0 == ~st1~0; {21958#true} is VALID [2022-02-20 18:31:23,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {21958#true} assume ~send1~0 == ~id1~0; {21958#true} is VALID [2022-02-20 18:31:23,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {21958#true} assume 0 == ~mode1~0 % 256; {21958#true} is VALID [2022-02-20 18:31:23,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {21958#true} assume ~id2~0 >= 0; {21958#true} is VALID [2022-02-20 18:31:23,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {21958#true} assume 0 == ~st2~0; {21958#true} is VALID [2022-02-20 18:31:23,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {21958#true} assume ~send2~0 == ~id2~0; {21958#true} is VALID [2022-02-20 18:31:23,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {21958#true} assume 0 == ~mode2~0 % 256; {21958#true} is VALID [2022-02-20 18:31:23,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {21958#true} assume ~id3~0 >= 0; {21958#true} is VALID [2022-02-20 18:31:23,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {21958#true} assume 0 == ~st3~0; {21958#true} is VALID [2022-02-20 18:31:23,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {21958#true} assume ~send3~0 == ~id3~0; {21958#true} is VALID [2022-02-20 18:31:23,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {21958#true} assume 0 == ~mode3~0 % 256; {21958#true} is VALID [2022-02-20 18:31:23,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {21958#true} assume ~id4~0 >= 0; {21958#true} is VALID [2022-02-20 18:31:23,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {21958#true} assume 0 == ~st4~0; {21958#true} is VALID [2022-02-20 18:31:23,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {21958#true} assume ~send4~0 == ~id4~0; {21958#true} is VALID [2022-02-20 18:31:23,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {21958#true} assume 0 == ~mode4~0 % 256; {21958#true} is VALID [2022-02-20 18:31:23,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {21958#true} assume ~id5~0 >= 0; {21958#true} is VALID [2022-02-20 18:31:23,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {21958#true} assume 0 == ~st5~0; {21958#true} is VALID [2022-02-20 18:31:23,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {21958#true} assume ~send5~0 == ~id5~0; {21958#true} is VALID [2022-02-20 18:31:23,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {21958#true} assume 0 == ~mode5~0 % 256; {21958#true} is VALID [2022-02-20 18:31:23,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {21958#true} assume ~id6~0 >= 0; {21958#true} is VALID [2022-02-20 18:31:23,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {21958#true} assume 0 == ~st6~0; {21958#true} is VALID [2022-02-20 18:31:23,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {21958#true} assume ~send6~0 == ~id6~0; {21958#true} is VALID [2022-02-20 18:31:23,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {21958#true} assume 0 == ~mode6~0 % 256; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,845 INFO L290 TraceCheckUtils]: 54: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,849 INFO L290 TraceCheckUtils]: 63: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,850 INFO L290 TraceCheckUtils]: 65: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,850 INFO L290 TraceCheckUtils]: 66: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0);node2_#t~ite5#1 := ~p2_new~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,855 INFO L290 TraceCheckUtils]: 77: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite6#1 := ~p3_new~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,855 INFO L290 TraceCheckUtils]: 78: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,856 INFO L290 TraceCheckUtils]: 79: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,858 INFO L290 TraceCheckUtils]: 84: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,859 INFO L290 TraceCheckUtils]: 86: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,859 INFO L290 TraceCheckUtils]: 87: Hoare triple {21960#(= (+ (* (- 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; {21960#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:31:23,860 INFO L290 TraceCheckUtils]: 88: Hoare triple {21960#(= (+ (* (- 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; {21959#false} is VALID [2022-02-20 18:31:23,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {21959#false} assume !(node6_~m6~0#1 != ~nomsg~0); {21959#false} is VALID [2022-02-20 18:31:23,860 INFO L290 TraceCheckUtils]: 90: Hoare triple {21959#false} ~mode6~0 := 0; {21959#false} is VALID [2022-02-20 18:31:23,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {21959#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; {21959#false} is VALID [2022-02-20 18:31:23,860 INFO L290 TraceCheckUtils]: 92: Hoare triple {21959#false} assume !(0 != ~mode7~0 % 256); {21959#false} is VALID [2022-02-20 18:31:23,860 INFO L290 TraceCheckUtils]: 93: Hoare triple {21959#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; {21959#false} is VALID [2022-02-20 18:31:23,860 INFO L290 TraceCheckUtils]: 94: Hoare triple {21959#false} ~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; {21959#false} is VALID [2022-02-20 18:31:23,861 INFO L290 TraceCheckUtils]: 95: Hoare triple {21959#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; {21959#false} is VALID [2022-02-20 18:31:23,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {21959#false} assume !(0 != ~mode8~0 % 256); {21959#false} is VALID [2022-02-20 18:31:23,861 INFO L290 TraceCheckUtils]: 97: Hoare triple {21959#false} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite11#1 := ~send8~0; {21959#false} is VALID [2022-02-20 18:31:23,861 INFO L290 TraceCheckUtils]: 98: Hoare triple {21959#false} ~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; {21959#false} is VALID [2022-02-20 18:31:23,861 INFO L290 TraceCheckUtils]: 99: Hoare triple {21959#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; {21959#false} is VALID [2022-02-20 18:31:23,861 INFO L290 TraceCheckUtils]: 100: Hoare triple {21959#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {21959#false} is VALID [2022-02-20 18:31:23,861 INFO L290 TraceCheckUtils]: 101: Hoare triple {21959#false} check_#res#1 := check_~tmp~1#1; {21959#false} is VALID [2022-02-20 18:31:23,862 INFO L290 TraceCheckUtils]: 102: Hoare triple {21959#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; {21959#false} is VALID [2022-02-20 18:31:23,862 INFO L290 TraceCheckUtils]: 103: Hoare triple {21959#false} assume 0 == assert_~arg#1 % 256; {21959#false} is VALID [2022-02-20 18:31:23,862 INFO L290 TraceCheckUtils]: 104: Hoare triple {21959#false} assume !false; {21959#false} is VALID [2022-02-20 18:31:23,862 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:23,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:23,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796900407] [2022-02-20 18:31:23,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796900407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:23,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:23,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:23,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74567352] [2022-02-20 18:31:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:23,864 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:23,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:23,864 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:23,941 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:23,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:23,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:23,942 INFO L87 Difference]: Start difference. First operand 1957 states and 3028 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:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:25,341 INFO L93 Difference]: Finished difference Result 5545 states and 8630 transitions. [2022-02-20 18:31:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:25,342 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:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:25,342 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:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:25,344 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:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-02-20 18:31:25,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 420 transitions. [2022-02-20 18:31:25,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 420 edges. 420 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:26,109 INFO L225 Difference]: With dead ends: 5545 [2022-02-20 18:31:26,109 INFO L226 Difference]: Without dead ends: 3655 [2022-02-20 18:31:26,111 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:26,112 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 91 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 409 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:26,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 409 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:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3655 states. [2022-02-20 18:31:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3655 to 3653. [2022-02-20 18:31:26,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:26,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3655 states. Second operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call 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:26,241 INFO L74 IsIncluded]: Start isIncluded. First operand 3655 states. Second operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call 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:26,246 INFO L87 Difference]: Start difference. First operand 3655 states. Second operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call 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:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:26,731 INFO L93 Difference]: Finished difference Result 3655 states and 5637 transitions. [2022-02-20 18:31:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 5637 transitions. [2022-02-20 18:31:26,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:26,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:26,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 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 3655 states. [2022-02-20 18:31:26,746 INFO L87 Difference]: Start difference. First operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 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 3655 states. [2022-02-20 18:31:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:27,171 INFO L93 Difference]: Finished difference Result 3655 states and 5637 transitions. [2022-02-20 18:31:27,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 5637 transitions. [2022-02-20 18:31:27,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:27,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:27,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:27,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 3652 states have (on average 1.5432639649507118) internal successors, (5636), 3652 states have internal predecessors, (5636), 0 states have call successors, (0), 0 states have call 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:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 5636 transitions. [2022-02-20 18:31:27,695 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 5636 transitions. Word has length 105 [2022-02-20 18:31:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:27,695 INFO L470 AbstractCegarLoop]: Abstraction has 3653 states and 5636 transitions. [2022-02-20 18:31:27,695 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:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 5636 transitions. [2022-02-20 18:31:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:31:27,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:27,697 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:27,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:31:27,697 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1414973228, now seen corresponding path program 1 times [2022-02-20 18:31:27,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:27,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779948215] [2022-02-20 18:31:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:27,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {40233#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(41, 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]; {40233#true} is VALID [2022-02-20 18:31:27,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {40233#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; {40233#true} is VALID [2022-02-20 18:31:27,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {40233#true} assume 0 == ~r1~0 % 256; {40233#true} is VALID [2022-02-20 18:31:27,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {40233#true} assume ~id1~0 >= 0; {40233#true} is VALID [2022-02-20 18:31:27,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {40233#true} assume 0 == ~st1~0; {40235#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:27,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {40235#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {40235#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:27,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {40235#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {40235#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:27,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {40235#(<= ~st1~0 0)} assume ~id2~0 >= 0; {40235#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:27,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {40235#(<= ~st1~0 0)} assume 0 == ~st2~0; {40236#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {40236#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {40236#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {40236#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {40236#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {40236#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {40236#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {40236#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {40237#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {40238#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:27,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {40239#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {40240#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id8~0 >= 0; {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {40241#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~st8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 == ~id8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode8~0 % 256; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id8~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,912 INFO L290 TraceCheckUtils]: 62: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,913 INFO L290 TraceCheckUtils]: 64: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {40242#(<= (+ ~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); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,914 INFO L290 TraceCheckUtils]: 66: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,914 INFO L290 TraceCheckUtils]: 67: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,915 INFO L290 TraceCheckUtils]: 68: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,915 INFO L290 TraceCheckUtils]: 69: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,916 INFO L290 TraceCheckUtils]: 70: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,916 INFO L290 TraceCheckUtils]: 71: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,917 INFO L290 TraceCheckUtils]: 72: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,917 INFO L290 TraceCheckUtils]: 73: Hoare triple {40242#(<= (+ ~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 := ~p2_new~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,918 INFO L290 TraceCheckUtils]: 74: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,918 INFO L290 TraceCheckUtils]: 75: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,919 INFO L290 TraceCheckUtils]: 76: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {40242#(<= (+ ~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 := ~p3_new~0; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,919 INFO L290 TraceCheckUtils]: 78: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,920 INFO L290 TraceCheckUtils]: 79: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,921 INFO L290 TraceCheckUtils]: 81: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,921 INFO L290 TraceCheckUtils]: 82: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,922 INFO L290 TraceCheckUtils]: 83: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,922 INFO L290 TraceCheckUtils]: 84: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,923 INFO L290 TraceCheckUtils]: 86: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,923 INFO L290 TraceCheckUtils]: 87: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,924 INFO L290 TraceCheckUtils]: 88: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,924 INFO L290 TraceCheckUtils]: 89: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,925 INFO L290 TraceCheckUtils]: 91: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,926 INFO L290 TraceCheckUtils]: 92: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,926 INFO L290 TraceCheckUtils]: 93: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,926 INFO L290 TraceCheckUtils]: 94: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,927 INFO L290 TraceCheckUtils]: 95: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,927 INFO L290 TraceCheckUtils]: 96: Hoare triple {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode8~0 % 256); {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,928 INFO L290 TraceCheckUtils]: 97: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,928 INFO L290 TraceCheckUtils]: 98: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,929 INFO L290 TraceCheckUtils]: 99: Hoare triple {40242#(<= (+ ~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; {40242#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 18:31:27,929 INFO L290 TraceCheckUtils]: 100: Hoare triple {40242#(<= (+ ~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; {40234#false} is VALID [2022-02-20 18:31:27,929 INFO L290 TraceCheckUtils]: 101: Hoare triple {40234#false} check_#res#1 := check_~tmp~1#1; {40234#false} is VALID [2022-02-20 18:31:27,929 INFO L290 TraceCheckUtils]: 102: Hoare triple {40234#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; {40234#false} is VALID [2022-02-20 18:31:27,930 INFO L290 TraceCheckUtils]: 103: Hoare triple {40234#false} assume 0 == assert_~arg#1 % 256; {40234#false} is VALID [2022-02-20 18:31:27,930 INFO L290 TraceCheckUtils]: 104: Hoare triple {40234#false} assume !false; {40234#false} is VALID [2022-02-20 18:31:27,930 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:27,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:27,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779948215] [2022-02-20 18:31:27,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779948215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:27,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:27,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 18:31:27,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364777291] [2022-02-20 18:31:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:27,932 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:27,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:27,933 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:28,009 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:28,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:31:28,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:28,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:31:28,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:31:28,010 INFO L87 Difference]: Start difference. First operand 3653 states and 5636 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)