./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.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 cfa1fee5fdadabd96a5731bb0a647950318689cce856270fe55e6bf96a429cbb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:50:38,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:50:38,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:50:39,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:50:39,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:50:39,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:50:39,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:50:39,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:50:39,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:50:39,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:50:39,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:50:39,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:50:39,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:50:39,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:50:39,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:50:39,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:50:39,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:50:39,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:50:39,027 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:50:39,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:50:39,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:50:39,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:50:39,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:50:39,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:50:39,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:50:39,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:50:39,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:50:39,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:50:39,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:50:39,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:50:39,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:50:39,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:50:39,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:50:39,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:50:39,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:50:39,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:50:39,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:50:39,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:50:39,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:50:39,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:50:39,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:50:39,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:50:39,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:50:39,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:50:39,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:50:39,072 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:50:39,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:50:39,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:50:39,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:50:39,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:50:39,073 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:50:39,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:50:39,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:50:39,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:50:39,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:50:39,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:50:39,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:50:39,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:50:39,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:50:39,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:50:39,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:50:39,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:50:39,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:50:39,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:50:39,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:50:39,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:50:39,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:39,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:50:39,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:50:39,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:50:39,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:50:39,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:50:39,077 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:50:39,077 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:50:39,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:50:39,077 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 -> cfa1fee5fdadabd96a5731bb0a647950318689cce856270fe55e6bf96a429cbb [2022-02-20 19:50:39,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:50:39,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:50:39,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:50:39,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:50:39,295 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:50:39,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:50:39,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6586ad6f/c74d17467d7f482a87e12ba1aee872a2/FLAG59c07cbf8 [2022-02-20 19:50:39,888 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:50:39,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:50:39,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6586ad6f/c74d17467d7f482a87e12ba1aee872a2/FLAG59c07cbf8 [2022-02-20 19:50:40,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6586ad6f/c74d17467d7f482a87e12ba1aee872a2 [2022-02-20 19:50:40,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:50:40,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:50:40,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:40,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:50:40,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:50:40,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:40" (1/1) ... [2022-02-20 19:50:40,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de79471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:40, skipping insertion in model container [2022-02-20 19:50:40,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:50:40" (1/1) ... [2022-02-20 19:50:40,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:50:40,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:50:40,805 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.c[20454,20467] [2022-02-20 19:50:40,842 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.c[23271,23284] [2022-02-20 19:50:41,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:41,369 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:50:41,415 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.c[20454,20467] [2022-02-20 19:50:41,420 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/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.c[23271,23284] [2022-02-20 19:50:41,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:50:41,757 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:50:41,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41 WrapperNode [2022-02-20 19:50:41,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:50:41,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:41,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:50:41,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:50:41,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:41,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,138 INFO L137 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5208 [2022-02-20 19:50:42,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:50:42,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:50:42,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:50:42,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:50:42,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:50:42,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:50:42,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:50:42,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:50:42,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (1/1) ... [2022-02-20 19:50:42,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:50:42,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:50:42,512 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 19:50:42,532 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 19:50:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:50:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:50:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:50:42,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:50:42,643 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:50:42,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:50:49,192 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:50:49,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:50:49,204 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:50:49,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:49 BoogieIcfgContainer [2022-02-20 19:50:49,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:50:49,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:50:49,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:50:49,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:50:49,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:50:40" (1/3) ... [2022-02-20 19:50:49,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5a1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:49, skipping insertion in model container [2022-02-20 19:50:49,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:50:41" (2/3) ... [2022-02-20 19:50:49,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5a1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:50:49, skipping insertion in model container [2022-02-20 19:50:49,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:50:49" (3/3) ... [2022-02-20 19:50:49,216 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:50:49,219 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:50:49,219 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:50:49,253 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:50:49,257 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 19:50:49,257 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:50:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 19:50:49,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:49,327 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] [2022-02-20 19:50:49,328 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1985263371, now seen corresponding path program 1 times [2022-02-20 19:50:49,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:49,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052687155] [2022-02-20 19:50:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:49,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:49,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {949#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet57#1);havoc main_#t~nondet57#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet55#1, main2_#t~ret56#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet55#1 && main2_#t~nondet55#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet55#1;havoc main2_#t~nondet55#1; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret52#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {951#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:50:49,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {951#(<= (+ ~a17~0 124) 0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {950#false} is VALID [2022-02-20 19:50:49,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {950#false} assume !false; {950#false} is VALID [2022-02-20 19:50:49,527 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 19:50:49,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:49,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052687155] [2022-02-20 19:50:49,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052687155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:49,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:49,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:50:49,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064260284] [2022-02-20 19:50:49,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:49,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:50:49,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:49,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:49,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:49,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:50:49,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:50:49,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:50:49,583 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.8971367974549311) internal successors, (1789), 945 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:55,218 INFO L93 Difference]: Finished difference Result 2605 states and 4986 transitions. [2022-02-20 19:50:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:50:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:50:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:50:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4986 transitions. [2022-02-20 19:50:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4986 transitions. [2022-02-20 19:50:55,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4986 transitions. [2022-02-20 19:50:58,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4986 edges. 4986 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:58,992 INFO L225 Difference]: With dead ends: 2605 [2022-02-20 19:50:58,992 INFO L226 Difference]: Without dead ends: 1631 [2022-02-20 19:50:59,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 19:50:59,004 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 1014 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:50:59,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1014 Valid, 744 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:50:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-02-20 19:50:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-02-20 19:50:59,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:50:59,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:59,105 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:59,109 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:59,214 INFO L93 Difference]: Finished difference Result 1631 states and 2635 transitions. [2022-02-20 19:50:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2635 transitions. [2022-02-20 19:50:59,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:59,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:59,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:50:59,231 INFO L87 Difference]: Start difference. First operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:50:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:50:59,321 INFO L93 Difference]: Finished difference Result 1631 states and 2635 transitions. [2022-02-20 19:50:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2635 transitions. [2022-02-20 19:50:59,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:50:59,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:50:59,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:50:59,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:50:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6175567833026396) internal successors, (2635), 1630 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2635 transitions. [2022-02-20 19:50:59,414 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2635 transitions. Word has length 24 [2022-02-20 19:50:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:50:59,415 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2635 transitions. [2022-02-20 19:50:59,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2635 transitions. [2022-02-20 19:50:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 19:50:59,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:50:59,417 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] [2022-02-20 19:50:59,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:50:59,423 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:50:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:50:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1343709944, now seen corresponding path program 1 times [2022-02-20 19:50:59,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:50:59,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569089201] [2022-02-20 19:50:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:50:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:50:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:50:59,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {8513#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8513#true} is VALID [2022-02-20 19:50:59,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {8513#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {8513#true} is VALID [2022-02-20 19:50:59,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {8513#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8513#true} is VALID [2022-02-20 19:50:59,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {8513#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8515#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:50:59,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {8515#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8516#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:50:59,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {8516#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8517#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:50:59,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {8517#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8514#false} is VALID [2022-02-20 19:50:59,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {8514#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;main1_~i2~0#1 := 0; {8514#false} is VALID [2022-02-20 19:50:59,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {8514#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {8514#false} assume !(0 != ~mode1~0 % 256); {8514#false} is VALID [2022-02-20 19:50:59,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {8514#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8514#false} is VALID [2022-02-20 19:50:59,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {8514#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {8514#false} is VALID [2022-02-20 19:50:59,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {8514#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {8514#false} assume !(0 != ~mode2~0 % 256); {8514#false} is VALID [2022-02-20 19:50:59,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {8514#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8514#false} is VALID [2022-02-20 19:50:59,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {8514#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8514#false} is VALID [2022-02-20 19:50:59,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {8514#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {8514#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {8514#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:50:59,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {8514#false} ~mode3~0 := 0; {8514#false} is VALID [2022-02-20 19:50:59,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {8514#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {8514#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {8514#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:50:59,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {8514#false} ~mode4~0 := 0; {8514#false} is VALID [2022-02-20 19:50:59,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {8514#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {8514#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {8514#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:50:59,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {8514#false} ~mode5~0 := 0; {8514#false} is VALID [2022-02-20 19:50:59,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {8514#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {8514#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {8514#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:50:59,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {8514#false} ~mode6~0 := 0; {8514#false} is VALID [2022-02-20 19:50:59,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {8514#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {8514#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {8514#false} is VALID [2022-02-20 19:50:59,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {8514#false} assume !(node7_~m7~0#1 != ~nomsg~0); {8514#false} is VALID [2022-02-20 19:50:59,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {8514#false} ~mode7~0 := 0; {8514#false} is VALID [2022-02-20 19:50:59,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {8514#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8514#false} is VALID [2022-02-20 19:50:59,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {8514#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {8514#false} is VALID [2022-02-20 19:50:59,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {8514#false} check_#res#1 := check_~tmp~1#1; {8514#false} is VALID [2022-02-20 19:50:59,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {8514#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {8514#false} is VALID [2022-02-20 19:50:59,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {8514#false} assume 0 == assert_~arg#1 % 256; {8514#false} is VALID [2022-02-20 19:50:59,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {8514#false} assume !false; {8514#false} is VALID [2022-02-20 19:50:59,565 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 19:50:59,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:50:59,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569089201] [2022-02-20 19:50:59,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569089201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:50:59,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:50:59,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:50:59,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947724698] [2022-02-20 19:50:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:50:59,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 19:50:59,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:50:59,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:50:59,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:50:59,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:50:59,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:50:59,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:50:59,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:50:59,595 INFO L87 Difference]: Start difference. First operand 1631 states and 2635 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:03,540 INFO L93 Difference]: Finished difference Result 1705 states and 2750 transitions. [2022-02-20 19:51:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:51:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 19:51:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:51:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1771 transitions. [2022-02-20 19:51:03,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1771 transitions. [2022-02-20 19:51:04,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1771 edges. 1771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:04,856 INFO L225 Difference]: With dead ends: 1705 [2022-02-20 19:51:04,856 INFO L226 Difference]: Without dead ends: 1631 [2022-02-20 19:51:04,856 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 19:51:04,857 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 3 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:51:04,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6563 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-02-20 19:51:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-02-20 19:51:04,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:04,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:04,888 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:04,890 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:04,975 INFO L93 Difference]: Finished difference Result 1631 states and 2585 transitions. [2022-02-20 19:51:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2585 transitions. [2022-02-20 19:51:04,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:04,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:04,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:51:04,981 INFO L87 Difference]: Start difference. First operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 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 1631 states. [2022-02-20 19:51:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:05,062 INFO L93 Difference]: Finished difference Result 1631 states and 2585 transitions. [2022-02-20 19:51:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2585 transitions. [2022-02-20 19:51:05,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:05,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:05,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:05,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.5868631062001228) internal successors, (2585), 1630 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2585 transitions. [2022-02-20 19:51:05,154 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2585 transitions. Word has length 42 [2022-02-20 19:51:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:05,154 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2585 transitions. [2022-02-20 19:51:05,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2585 transitions. [2022-02-20 19:51:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:05,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:05,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:05,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:51:05,158 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash -461668761, now seen corresponding path program 1 times [2022-02-20 19:51:05,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:05,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657793334] [2022-02-20 19:51:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:05,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {15175#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {15175#true} is VALID [2022-02-20 19:51:05,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {15175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {15175#true} is VALID [2022-02-20 19:51:05,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {15175#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15175#true} is VALID [2022-02-20 19:51:05,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {15175#true} assume 0 == ~r1~0 % 256; {15175#true} is VALID [2022-02-20 19:51:05,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {15175#true} assume ~id1~0 >= 0; {15175#true} is VALID [2022-02-20 19:51:05,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {15175#true} assume 0 == ~st1~0; {15175#true} is VALID [2022-02-20 19:51:05,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {15175#true} assume ~send1~0 == ~id1~0; {15175#true} is VALID [2022-02-20 19:51:05,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {15175#true} assume 0 == ~mode1~0 % 256; {15175#true} is VALID [2022-02-20 19:51:05,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {15175#true} assume ~id2~0 >= 0; {15175#true} is VALID [2022-02-20 19:51:05,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {15175#true} assume 0 == ~st2~0; {15175#true} is VALID [2022-02-20 19:51:05,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {15175#true} assume ~send2~0 == ~id2~0; {15175#true} is VALID [2022-02-20 19:51:05,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {15175#true} assume 0 == ~mode2~0 % 256; {15175#true} is VALID [2022-02-20 19:51:05,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {15175#true} assume ~id3~0 >= 0; {15175#true} is VALID [2022-02-20 19:51:05,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {15175#true} assume 0 == ~st3~0; {15175#true} is VALID [2022-02-20 19:51:05,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {15175#true} assume ~send3~0 == ~id3~0; {15175#true} is VALID [2022-02-20 19:51:05,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {15175#true} assume 0 == ~mode3~0 % 256; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,342 INFO L290 TraceCheckUtils]: 51: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {15177#(= (+ (* (- 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;main1_~i2~0#1 := 0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,345 INFO L290 TraceCheckUtils]: 58: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,347 INFO L290 TraceCheckUtils]: 62: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,348 INFO L290 TraceCheckUtils]: 63: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,348 INFO L290 TraceCheckUtils]: 64: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,348 INFO L290 TraceCheckUtils]: 65: Hoare triple {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {15177#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:51:05,349 INFO L290 TraceCheckUtils]: 66: Hoare triple {15177#(= (+ (* (- 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; {15176#false} is VALID [2022-02-20 19:51:05,349 INFO L290 TraceCheckUtils]: 67: Hoare triple {15176#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15176#false} is VALID [2022-02-20 19:51:05,349 INFO L290 TraceCheckUtils]: 68: Hoare triple {15176#false} ~mode3~0 := 0; {15176#false} is VALID [2022-02-20 19:51:05,349 INFO L290 TraceCheckUtils]: 69: Hoare triple {15176#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,350 INFO L290 TraceCheckUtils]: 70: Hoare triple {15176#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {15176#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15176#false} is VALID [2022-02-20 19:51:05,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {15176#false} ~mode4~0 := 0; {15176#false} is VALID [2022-02-20 19:51:05,350 INFO L290 TraceCheckUtils]: 73: Hoare triple {15176#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,350 INFO L290 TraceCheckUtils]: 74: Hoare triple {15176#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,350 INFO L290 TraceCheckUtils]: 75: Hoare triple {15176#false} assume !(node5_~m5~0#1 != ~nomsg~0); {15176#false} is VALID [2022-02-20 19:51:05,350 INFO L290 TraceCheckUtils]: 76: Hoare triple {15176#false} ~mode5~0 := 0; {15176#false} is VALID [2022-02-20 19:51:05,351 INFO L290 TraceCheckUtils]: 77: Hoare triple {15176#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,351 INFO L290 TraceCheckUtils]: 78: Hoare triple {15176#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,351 INFO L290 TraceCheckUtils]: 79: Hoare triple {15176#false} assume !(node6_~m6~0#1 != ~nomsg~0); {15176#false} is VALID [2022-02-20 19:51:05,351 INFO L290 TraceCheckUtils]: 80: Hoare triple {15176#false} ~mode6~0 := 0; {15176#false} is VALID [2022-02-20 19:51:05,351 INFO L290 TraceCheckUtils]: 81: Hoare triple {15176#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,351 INFO L290 TraceCheckUtils]: 82: Hoare triple {15176#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {15176#false} is VALID [2022-02-20 19:51:05,352 INFO L290 TraceCheckUtils]: 83: Hoare triple {15176#false} assume !(node7_~m7~0#1 != ~nomsg~0); {15176#false} is VALID [2022-02-20 19:51:05,352 INFO L290 TraceCheckUtils]: 84: Hoare triple {15176#false} ~mode7~0 := 0; {15176#false} is VALID [2022-02-20 19:51:05,352 INFO L290 TraceCheckUtils]: 85: Hoare triple {15176#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15176#false} is VALID [2022-02-20 19:51:05,352 INFO L290 TraceCheckUtils]: 86: Hoare triple {15176#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {15176#false} is VALID [2022-02-20 19:51:05,352 INFO L290 TraceCheckUtils]: 87: Hoare triple {15176#false} check_#res#1 := check_~tmp~1#1; {15176#false} is VALID [2022-02-20 19:51:05,352 INFO L290 TraceCheckUtils]: 88: Hoare triple {15176#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15176#false} is VALID [2022-02-20 19:51:05,352 INFO L290 TraceCheckUtils]: 89: Hoare triple {15176#false} assume 0 == assert_~arg#1 % 256; {15176#false} is VALID [2022-02-20 19:51:05,353 INFO L290 TraceCheckUtils]: 90: Hoare triple {15176#false} assume !false; {15176#false} is VALID [2022-02-20 19:51:05,354 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 19:51:05,354 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:05,354 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657793334] [2022-02-20 19:51:05,354 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657793334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:05,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:05,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:05,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426901429] [2022-02-20 19:51:05,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:05,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:05,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:05,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:05,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:05,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:05,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:05,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:05,415 INFO L87 Difference]: Start difference. First operand 1631 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:07,085 INFO L93 Difference]: Finished difference Result 1765 states and 2797 transitions. [2022-02-20 19:51:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:07,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:08,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:08,655 INFO L225 Difference]: With dead ends: 1765 [2022-02-20 19:51:08,655 INFO L226 Difference]: Without dead ends: 1695 [2022-02-20 19:51:08,656 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 19:51:08,656 INFO L933 BasicCegarLoop]: 1674 mSDtfsCounter, 1532 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1791 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 19:51:08,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 1791 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-02-20 19:51:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2022-02-20 19:51:08,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:08,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.5872264931992903) internal successors, (2684), 1692 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:08,689 INFO L74 IsIncluded]: Start isIncluded. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.5872264931992903) internal successors, (2684), 1692 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:08,691 INFO L87 Difference]: Start difference. First operand 1695 states. Second operand has 1693 states, 1691 states have (on average 1.5872264931992903) internal successors, (2684), 1692 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:08,774 INFO L93 Difference]: Finished difference Result 1695 states and 2685 transitions. [2022-02-20 19:51:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2685 transitions. [2022-02-20 19:51:08,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:08,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:08,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 1693 states, 1691 states have (on average 1.5872264931992903) internal successors, (2684), 1692 states have internal predecessors, (2684), 0 states have call successors, (0), 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 1695 states. [2022-02-20 19:51:08,793 INFO L87 Difference]: Start difference. First operand has 1693 states, 1691 states have (on average 1.5872264931992903) internal successors, (2684), 1692 states have internal predecessors, (2684), 0 states have call successors, (0), 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 1695 states. [2022-02-20 19:51:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:08,879 INFO L93 Difference]: Finished difference Result 1695 states and 2685 transitions. [2022-02-20 19:51:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2685 transitions. [2022-02-20 19:51:08,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:08,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:08,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:08,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.5872264931992903) internal successors, (2684), 1692 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2684 transitions. [2022-02-20 19:51:08,981 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2684 transitions. Word has length 91 [2022-02-20 19:51:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:08,982 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 2684 transitions. [2022-02-20 19:51:08,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2684 transitions. [2022-02-20 19:51:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:08,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:08,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:08,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:51:08,984 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1207251491, now seen corresponding path program 1 times [2022-02-20 19:51:08,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:08,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369727078] [2022-02-20 19:51:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:09,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {22100#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {22100#true} is VALID [2022-02-20 19:51:09,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {22100#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {22100#true} is VALID [2022-02-20 19:51:09,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {22100#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22100#true} is VALID [2022-02-20 19:51:09,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {22100#true} assume 0 == ~r1~0 % 256; {22100#true} is VALID [2022-02-20 19:51:09,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {22100#true} assume ~id1~0 >= 0; {22100#true} is VALID [2022-02-20 19:51:09,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {22100#true} assume 0 == ~st1~0; {22100#true} is VALID [2022-02-20 19:51:09,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {22100#true} assume ~send1~0 == ~id1~0; {22100#true} is VALID [2022-02-20 19:51:09,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {22100#true} assume 0 == ~mode1~0 % 256; {22100#true} is VALID [2022-02-20 19:51:09,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {22100#true} assume ~id2~0 >= 0; {22100#true} is VALID [2022-02-20 19:51:09,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {22100#true} assume 0 == ~st2~0; {22100#true} is VALID [2022-02-20 19:51:09,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {22100#true} assume ~send2~0 == ~id2~0; {22100#true} is VALID [2022-02-20 19:51:09,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {22100#true} assume 0 == ~mode2~0 % 256; {22100#true} is VALID [2022-02-20 19:51:09,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {22100#true} assume ~id3~0 >= 0; {22100#true} is VALID [2022-02-20 19:51:09,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {22100#true} assume 0 == ~st3~0; {22100#true} is VALID [2022-02-20 19:51:09,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {22100#true} assume ~send3~0 == ~id3~0; {22100#true} is VALID [2022-02-20 19:51:09,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {22100#true} assume 0 == ~mode3~0 % 256; {22100#true} is VALID [2022-02-20 19:51:09,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {22100#true} assume ~id4~0 >= 0; {22100#true} is VALID [2022-02-20 19:51:09,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {22100#true} assume 0 == ~st4~0; {22100#true} is VALID [2022-02-20 19:51:09,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {22100#true} assume ~send4~0 == ~id4~0; {22100#true} is VALID [2022-02-20 19:51:09,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {22100#true} assume 0 == ~mode4~0 % 256; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,079 INFO L290 TraceCheckUtils]: 39: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,080 INFO L290 TraceCheckUtils]: 42: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {22102#(= (+ (* (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;main1_~i2~0#1 := 0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,092 INFO L290 TraceCheckUtils]: 59: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22102#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:51:09,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {22102#(= (+ (* (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; {22101#false} is VALID [2022-02-20 19:51:09,097 INFO L290 TraceCheckUtils]: 71: Hoare triple {22101#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22101#false} is VALID [2022-02-20 19:51:09,097 INFO L290 TraceCheckUtils]: 72: Hoare triple {22101#false} ~mode4~0 := 0; {22101#false} is VALID [2022-02-20 19:51:09,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {22101#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {22101#false} is VALID [2022-02-20 19:51:09,097 INFO L290 TraceCheckUtils]: 74: Hoare triple {22101#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {22101#false} is VALID [2022-02-20 19:51:09,097 INFO L290 TraceCheckUtils]: 75: Hoare triple {22101#false} assume !(node5_~m5~0#1 != ~nomsg~0); {22101#false} is VALID [2022-02-20 19:51:09,097 INFO L290 TraceCheckUtils]: 76: Hoare triple {22101#false} ~mode5~0 := 0; {22101#false} is VALID [2022-02-20 19:51:09,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {22101#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {22101#false} is VALID [2022-02-20 19:51:09,098 INFO L290 TraceCheckUtils]: 78: Hoare triple {22101#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {22101#false} is VALID [2022-02-20 19:51:09,102 INFO L290 TraceCheckUtils]: 79: Hoare triple {22101#false} assume !(node6_~m6~0#1 != ~nomsg~0); {22101#false} is VALID [2022-02-20 19:51:09,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {22101#false} ~mode6~0 := 0; {22101#false} is VALID [2022-02-20 19:51:09,102 INFO L290 TraceCheckUtils]: 81: Hoare triple {22101#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {22101#false} is VALID [2022-02-20 19:51:09,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {22101#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {22101#false} is VALID [2022-02-20 19:51:09,106 INFO L290 TraceCheckUtils]: 83: Hoare triple {22101#false} assume !(node7_~m7~0#1 != ~nomsg~0); {22101#false} is VALID [2022-02-20 19:51:09,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {22101#false} ~mode7~0 := 0; {22101#false} is VALID [2022-02-20 19:51:09,107 INFO L290 TraceCheckUtils]: 85: Hoare triple {22101#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22101#false} is VALID [2022-02-20 19:51:09,107 INFO L290 TraceCheckUtils]: 86: Hoare triple {22101#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {22101#false} is VALID [2022-02-20 19:51:09,107 INFO L290 TraceCheckUtils]: 87: Hoare triple {22101#false} check_#res#1 := check_~tmp~1#1; {22101#false} is VALID [2022-02-20 19:51:09,107 INFO L290 TraceCheckUtils]: 88: Hoare triple {22101#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22101#false} is VALID [2022-02-20 19:51:09,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {22101#false} assume 0 == assert_~arg#1 % 256; {22101#false} is VALID [2022-02-20 19:51:09,108 INFO L290 TraceCheckUtils]: 90: Hoare triple {22101#false} assume !false; {22101#false} is VALID [2022-02-20 19:51:09,109 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 19:51:09,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:09,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369727078] [2022-02-20 19:51:09,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369727078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:09,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:09,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:09,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052775422] [2022-02-20 19:51:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:09,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:09,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:09,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:09,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:09,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:09,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:09,175 INFO L87 Difference]: Start difference. First operand 1693 states and 2684 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:10,916 INFO L93 Difference]: Finished difference Result 1945 states and 3084 transitions. [2022-02-20 19:51:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:10,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:12,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:12,459 INFO L225 Difference]: With dead ends: 1945 [2022-02-20 19:51:12,459 INFO L226 Difference]: Without dead ends: 1813 [2022-02-20 19:51:12,460 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 19:51:12,461 INFO L933 BasicCegarLoop]: 1669 mSDtfsCounter, 1528 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1790 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 19:51:12,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1528 Valid, 1790 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2022-02-20 19:51:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1811. [2022-02-20 19:51:12,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:12,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.5870646766169154) internal successors, (2871), 1810 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,506 INFO L74 IsIncluded]: Start isIncluded. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.5870646766169154) internal successors, (2871), 1810 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,507 INFO L87 Difference]: Start difference. First operand 1813 states. Second operand has 1811 states, 1809 states have (on average 1.5870646766169154) internal successors, (2871), 1810 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:12,596 INFO L93 Difference]: Finished difference Result 1813 states and 2872 transitions. [2022-02-20 19:51:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2872 transitions. [2022-02-20 19:51:12,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:12,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:12,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 1811 states, 1809 states have (on average 1.5870646766169154) internal successors, (2871), 1810 states have internal predecessors, (2871), 0 states have call successors, (0), 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 1813 states. [2022-02-20 19:51:12,603 INFO L87 Difference]: Start difference. First operand has 1811 states, 1809 states have (on average 1.5870646766169154) internal successors, (2871), 1810 states have internal predecessors, (2871), 0 states have call successors, (0), 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 1813 states. [2022-02-20 19:51:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:12,697 INFO L93 Difference]: Finished difference Result 1813 states and 2872 transitions. [2022-02-20 19:51:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2872 transitions. [2022-02-20 19:51:12,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:12,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:12,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:12,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1809 states have (on average 1.5870646766169154) internal successors, (2871), 1810 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2871 transitions. [2022-02-20 19:51:12,798 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2871 transitions. Word has length 91 [2022-02-20 19:51:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:12,799 INFO L470 AbstractCegarLoop]: Abstraction has 1811 states and 2871 transitions. [2022-02-20 19:51:12,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2871 transitions. [2022-02-20 19:51:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:12,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:12,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:12,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:51:12,800 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:12,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1147684947, now seen corresponding path program 1 times [2022-02-20 19:51:12,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:12,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846166720] [2022-02-20 19:51:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:12,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:12,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {29609#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29609#true} is VALID [2022-02-20 19:51:12,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {29609#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {29609#true} is VALID [2022-02-20 19:51:12,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {29609#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29609#true} is VALID [2022-02-20 19:51:12,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {29609#true} assume 0 == ~r1~0 % 256; {29609#true} is VALID [2022-02-20 19:51:12,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {29609#true} assume ~id1~0 >= 0; {29609#true} is VALID [2022-02-20 19:51:12,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {29609#true} assume 0 == ~st1~0; {29609#true} is VALID [2022-02-20 19:51:12,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {29609#true} assume ~send1~0 == ~id1~0; {29609#true} is VALID [2022-02-20 19:51:12,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {29609#true} assume 0 == ~mode1~0 % 256; {29609#true} is VALID [2022-02-20 19:51:12,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {29609#true} assume ~id2~0 >= 0; {29609#true} is VALID [2022-02-20 19:51:12,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {29609#true} assume 0 == ~st2~0; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {29609#true} assume ~send2~0 == ~id2~0; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {29609#true} assume 0 == ~mode2~0 % 256; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {29609#true} assume ~id3~0 >= 0; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {29609#true} assume 0 == ~st3~0; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {29609#true} assume ~send3~0 == ~id3~0; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {29609#true} assume 0 == ~mode3~0 % 256; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {29609#true} assume ~id4~0 >= 0; {29609#true} is VALID [2022-02-20 19:51:12,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {29609#true} assume 0 == ~st4~0; {29609#true} is VALID [2022-02-20 19:51:12,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {29609#true} assume ~send4~0 == ~id4~0; {29609#true} is VALID [2022-02-20 19:51:12,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {29609#true} assume 0 == ~mode4~0 % 256; {29609#true} is VALID [2022-02-20 19:51:12,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {29609#true} assume ~id5~0 >= 0; {29609#true} is VALID [2022-02-20 19:51:12,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {29609#true} assume 0 == ~st5~0; {29609#true} is VALID [2022-02-20 19:51:12,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {29609#true} assume ~send5~0 == ~id5~0; {29609#true} is VALID [2022-02-20 19:51:12,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {29609#true} assume 0 == ~mode5~0 % 256; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,886 INFO L290 TraceCheckUtils]: 37: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,886 INFO L290 TraceCheckUtils]: 38: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {29611#(= (+ (* (- 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;main1_~i2~0#1 := 0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,894 INFO L290 TraceCheckUtils]: 59: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,895 INFO L290 TraceCheckUtils]: 60: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,895 INFO L290 TraceCheckUtils]: 62: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,897 INFO L290 TraceCheckUtils]: 66: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,898 INFO L290 TraceCheckUtils]: 69: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,898 INFO L290 TraceCheckUtils]: 70: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,899 INFO L290 TraceCheckUtils]: 72: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29611#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 74: Hoare triple {29611#(= (+ (* (- 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; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 75: Hoare triple {29610#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 76: Hoare triple {29610#false} ~mode5~0 := 0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 77: Hoare triple {29610#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 78: Hoare triple {29610#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 79: Hoare triple {29610#false} assume !(node6_~m6~0#1 != ~nomsg~0); {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {29610#false} ~mode6~0 := 0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {29610#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 82: Hoare triple {29610#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 83: Hoare triple {29610#false} assume !(node7_~m7~0#1 != ~nomsg~0); {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 84: Hoare triple {29610#false} ~mode7~0 := 0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 85: Hoare triple {29610#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 86: Hoare triple {29610#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {29610#false} is VALID [2022-02-20 19:51:12,900 INFO L290 TraceCheckUtils]: 87: Hoare triple {29610#false} check_#res#1 := check_~tmp~1#1; {29610#false} is VALID [2022-02-20 19:51:12,901 INFO L290 TraceCheckUtils]: 88: Hoare triple {29610#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29610#false} is VALID [2022-02-20 19:51:12,901 INFO L290 TraceCheckUtils]: 89: Hoare triple {29610#false} assume 0 == assert_~arg#1 % 256; {29610#false} is VALID [2022-02-20 19:51:12,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {29610#false} assume !false; {29610#false} is VALID [2022-02-20 19:51:12,901 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 19:51:12,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:12,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846166720] [2022-02-20 19:51:12,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846166720] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:12,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:12,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:12,902 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318139605] [2022-02-20 19:51:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:12,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:12,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:12,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:12,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:12,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:12,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:12,957 INFO L87 Difference]: Start difference. First operand 1811 states and 2871 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:14,755 INFO L93 Difference]: Finished difference Result 2287 states and 3625 transitions. [2022-02-20 19:51:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:14,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:16,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:16,308 INFO L225 Difference]: With dead ends: 2287 [2022-02-20 19:51:16,308 INFO L226 Difference]: Without dead ends: 2037 [2022-02-20 19:51:16,309 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 19:51:16,309 INFO L933 BasicCegarLoop]: 1664 mSDtfsCounter, 1524 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 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 19:51:16,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2022-02-20 19:51:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2035. [2022-02-20 19:51:16,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:16,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.5853418593212) internal successors, (3223), 2034 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,370 INFO L74 IsIncluded]: Start isIncluded. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.5853418593212) internal successors, (3223), 2034 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,372 INFO L87 Difference]: Start difference. First operand 2037 states. Second operand has 2035 states, 2033 states have (on average 1.5853418593212) internal successors, (3223), 2034 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:16,479 INFO L93 Difference]: Finished difference Result 2037 states and 3224 transitions. [2022-02-20 19:51:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3224 transitions. [2022-02-20 19:51:16,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:16,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:16,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 2035 states, 2033 states have (on average 1.5853418593212) internal successors, (3223), 2034 states have internal predecessors, (3223), 0 states have call successors, (0), 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 2037 states. [2022-02-20 19:51:16,485 INFO L87 Difference]: Start difference. First operand has 2035 states, 2033 states have (on average 1.5853418593212) internal successors, (3223), 2034 states have internal predecessors, (3223), 0 states have call successors, (0), 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 2037 states. [2022-02-20 19:51:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:16,599 INFO L93 Difference]: Finished difference Result 2037 states and 3224 transitions. [2022-02-20 19:51:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 3224 transitions. [2022-02-20 19:51:16,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:16,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:16,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:16,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2033 states have (on average 1.5853418593212) internal successors, (3223), 2034 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3223 transitions. [2022-02-20 19:51:16,722 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3223 transitions. Word has length 91 [2022-02-20 19:51:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:16,723 INFO L470 AbstractCegarLoop]: Abstraction has 2035 states and 3223 transitions. [2022-02-20 19:51:16,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3223 transitions. [2022-02-20 19:51:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:16,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:16,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:16,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:51:16,724 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash -446599735, now seen corresponding path program 1 times [2022-02-20 19:51:16,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:16,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537333627] [2022-02-20 19:51:16,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:16,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {38232#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {38232#true} is VALID [2022-02-20 19:51:16,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {38232#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {38232#true} is VALID [2022-02-20 19:51:16,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {38232#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {38232#true} is VALID [2022-02-20 19:51:16,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {38232#true} assume 0 == ~r1~0 % 256; {38232#true} is VALID [2022-02-20 19:51:16,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {38232#true} assume ~id1~0 >= 0; {38232#true} is VALID [2022-02-20 19:51:16,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {38232#true} assume 0 == ~st1~0; {38232#true} is VALID [2022-02-20 19:51:16,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {38232#true} assume ~send1~0 == ~id1~0; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {38232#true} assume 0 == ~mode1~0 % 256; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {38232#true} assume ~id2~0 >= 0; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {38232#true} assume 0 == ~st2~0; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {38232#true} assume ~send2~0 == ~id2~0; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {38232#true} assume 0 == ~mode2~0 % 256; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {38232#true} assume ~id3~0 >= 0; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {38232#true} assume 0 == ~st3~0; {38232#true} is VALID [2022-02-20 19:51:16,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {38232#true} assume ~send3~0 == ~id3~0; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {38232#true} assume 0 == ~mode3~0 % 256; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {38232#true} assume ~id4~0 >= 0; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {38232#true} assume 0 == ~st4~0; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {38232#true} assume ~send4~0 == ~id4~0; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {38232#true} assume 0 == ~mode4~0 % 256; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {38232#true} assume ~id5~0 >= 0; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {38232#true} assume 0 == ~st5~0; {38232#true} is VALID [2022-02-20 19:51:16,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {38232#true} assume ~send5~0 == ~id5~0; {38232#true} is VALID [2022-02-20 19:51:16,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {38232#true} assume 0 == ~mode5~0 % 256; {38232#true} is VALID [2022-02-20 19:51:16,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {38232#true} assume ~id6~0 >= 0; {38232#true} is VALID [2022-02-20 19:51:16,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {38232#true} assume 0 == ~st6~0; {38232#true} is VALID [2022-02-20 19:51:16,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {38232#true} assume ~send6~0 == ~id6~0; {38232#true} is VALID [2022-02-20 19:51:16,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {38232#true} assume 0 == ~mode6~0 % 256; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,806 INFO L290 TraceCheckUtils]: 43: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {38234#(= (+ (* (- 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;main1_~i2~0#1 := 0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,813 INFO L290 TraceCheckUtils]: 63: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,813 INFO L290 TraceCheckUtils]: 65: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,814 INFO L290 TraceCheckUtils]: 66: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,814 INFO L290 TraceCheckUtils]: 67: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,814 INFO L290 TraceCheckUtils]: 68: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,815 INFO L290 TraceCheckUtils]: 71: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,816 INFO L290 TraceCheckUtils]: 73: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,816 INFO L290 TraceCheckUtils]: 74: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {38234#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:51:16,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {38234#(= (+ (* (- 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; {38233#false} is VALID [2022-02-20 19:51:16,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {38233#false} assume !(node6_~m6~0#1 != ~nomsg~0); {38233#false} is VALID [2022-02-20 19:51:16,818 INFO L290 TraceCheckUtils]: 80: Hoare triple {38233#false} ~mode6~0 := 0; {38233#false} is VALID [2022-02-20 19:51:16,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {38233#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {38233#false} is VALID [2022-02-20 19:51:16,818 INFO L290 TraceCheckUtils]: 82: Hoare triple {38233#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 83: Hoare triple {38233#false} assume !(node7_~m7~0#1 != ~nomsg~0); {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 84: Hoare triple {38233#false} ~mode7~0 := 0; {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 85: Hoare triple {38233#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 86: Hoare triple {38233#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 87: Hoare triple {38233#false} check_#res#1 := check_~tmp~1#1; {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {38233#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 89: Hoare triple {38233#false} assume 0 == assert_~arg#1 % 256; {38233#false} is VALID [2022-02-20 19:51:16,819 INFO L290 TraceCheckUtils]: 90: Hoare triple {38233#false} assume !false; {38233#false} is VALID [2022-02-20 19:51:16,820 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 19:51:16,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:16,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537333627] [2022-02-20 19:51:16,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537333627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:16,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:16,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:16,821 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719835738] [2022-02-20 19:51:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:16,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:16,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:16,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:16,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:16,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:16,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:16,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:16,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:16,877 INFO L87 Difference]: Start difference. First operand 2035 states and 3223 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:18,853 INFO L93 Difference]: Finished difference Result 2935 states and 4641 transitions. [2022-02-20 19:51:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:18,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:20,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:20,483 INFO L225 Difference]: With dead ends: 2935 [2022-02-20 19:51:20,483 INFO L226 Difference]: Without dead ends: 2461 [2022-02-20 19:51:20,484 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 19:51:20,486 INFO L933 BasicCegarLoop]: 1659 mSDtfsCounter, 1520 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1788 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 19:51:20,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1520 Valid, 1788 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2022-02-20 19:51:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2459. [2022-02-20 19:51:20,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:20,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.5803825803825804) internal successors, (3883), 2458 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:20,640 INFO L74 IsIncluded]: Start isIncluded. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.5803825803825804) internal successors, (3883), 2458 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:20,644 INFO L87 Difference]: Start difference. First operand 2461 states. Second operand has 2459 states, 2457 states have (on average 1.5803825803825804) internal successors, (3883), 2458 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:20,884 INFO L93 Difference]: Finished difference Result 2461 states and 3884 transitions. [2022-02-20 19:51:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3884 transitions. [2022-02-20 19:51:20,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:20,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:20,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 2459 states, 2457 states have (on average 1.5803825803825804) internal successors, (3883), 2458 states have internal predecessors, (3883), 0 states have call successors, (0), 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 2461 states. [2022-02-20 19:51:20,895 INFO L87 Difference]: Start difference. First operand has 2459 states, 2457 states have (on average 1.5803825803825804) internal successors, (3883), 2458 states have internal predecessors, (3883), 0 states have call successors, (0), 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 2461 states. [2022-02-20 19:51:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:21,105 INFO L93 Difference]: Finished difference Result 2461 states and 3884 transitions. [2022-02-20 19:51:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3884 transitions. [2022-02-20 19:51:21,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:21,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:21,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:21,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2457 states have (on average 1.5803825803825804) internal successors, (3883), 2458 states have internal predecessors, (3883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3883 transitions. [2022-02-20 19:51:21,279 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3883 transitions. Word has length 91 [2022-02-20 19:51:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:21,279 INFO L470 AbstractCegarLoop]: Abstraction has 2459 states and 3883 transitions. [2022-02-20 19:51:21,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3883 transitions. [2022-02-20 19:51:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:21,280 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:21,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:21,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:51:21,280 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash -108806593, now seen corresponding path program 1 times [2022-02-20 19:51:21,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:21,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28476569] [2022-02-20 19:51:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:21,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {48975#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {48975#true} is VALID [2022-02-20 19:51:21,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {48975#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {48975#true} is VALID [2022-02-20 19:51:21,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {48975#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {48975#true} is VALID [2022-02-20 19:51:21,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {48975#true} assume 0 == ~r1~0 % 256; {48975#true} is VALID [2022-02-20 19:51:21,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {48975#true} assume ~id1~0 >= 0; {48975#true} is VALID [2022-02-20 19:51:21,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {48975#true} assume 0 == ~st1~0; {48975#true} is VALID [2022-02-20 19:51:21,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {48975#true} assume ~send1~0 == ~id1~0; {48975#true} is VALID [2022-02-20 19:51:21,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {48975#true} assume 0 == ~mode1~0 % 256; {48975#true} is VALID [2022-02-20 19:51:21,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {48975#true} assume ~id2~0 >= 0; {48975#true} is VALID [2022-02-20 19:51:21,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {48975#true} assume 0 == ~st2~0; {48975#true} is VALID [2022-02-20 19:51:21,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {48975#true} assume ~send2~0 == ~id2~0; {48975#true} is VALID [2022-02-20 19:51:21,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {48975#true} assume 0 == ~mode2~0 % 256; {48975#true} is VALID [2022-02-20 19:51:21,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {48975#true} assume ~id3~0 >= 0; {48975#true} is VALID [2022-02-20 19:51:21,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {48975#true} assume 0 == ~st3~0; {48975#true} is VALID [2022-02-20 19:51:21,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {48975#true} assume ~send3~0 == ~id3~0; {48975#true} is VALID [2022-02-20 19:51:21,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {48975#true} assume 0 == ~mode3~0 % 256; {48975#true} is VALID [2022-02-20 19:51:21,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {48975#true} assume ~id4~0 >= 0; {48975#true} is VALID [2022-02-20 19:51:21,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {48975#true} assume 0 == ~st4~0; {48975#true} is VALID [2022-02-20 19:51:21,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {48975#true} assume ~send4~0 == ~id4~0; {48975#true} is VALID [2022-02-20 19:51:21,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {48975#true} assume 0 == ~mode4~0 % 256; {48975#true} is VALID [2022-02-20 19:51:21,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {48975#true} assume ~id5~0 >= 0; {48975#true} is VALID [2022-02-20 19:51:21,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {48975#true} assume 0 == ~st5~0; {48975#true} is VALID [2022-02-20 19:51:21,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {48975#true} assume ~send5~0 == ~id5~0; {48975#true} is VALID [2022-02-20 19:51:21,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {48975#true} assume 0 == ~mode5~0 % 256; {48975#true} is VALID [2022-02-20 19:51:21,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {48975#true} assume ~id6~0 >= 0; {48975#true} is VALID [2022-02-20 19:51:21,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {48975#true} assume 0 == ~st6~0; {48975#true} is VALID [2022-02-20 19:51:21,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {48975#true} assume ~send6~0 == ~id6~0; {48975#true} is VALID [2022-02-20 19:51:21,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {48975#true} assume 0 == ~mode6~0 % 256; {48975#true} is VALID [2022-02-20 19:51:21,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {48975#true} assume ~id7~0 >= 0; {48975#true} is VALID [2022-02-20 19:51:21,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {48975#true} assume 0 == ~st7~0; {48975#true} is VALID [2022-02-20 19:51:21,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {48975#true} assume ~send7~0 == ~id7~0; {48975#true} is VALID [2022-02-20 19:51:21,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {48975#true} assume 0 == ~mode7~0 % 256; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,355 INFO L290 TraceCheckUtils]: 51: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,359 INFO L290 TraceCheckUtils]: 59: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,362 INFO L290 TraceCheckUtils]: 66: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,363 INFO L290 TraceCheckUtils]: 68: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,363 INFO L290 TraceCheckUtils]: 69: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,364 INFO L290 TraceCheckUtils]: 71: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,364 INFO L290 TraceCheckUtils]: 72: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,365 INFO L290 TraceCheckUtils]: 73: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,365 INFO L290 TraceCheckUtils]: 74: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,366 INFO L290 TraceCheckUtils]: 75: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,366 INFO L290 TraceCheckUtils]: 76: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,366 INFO L290 TraceCheckUtils]: 77: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,367 INFO L290 TraceCheckUtils]: 78: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,367 INFO L290 TraceCheckUtils]: 79: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:51:21,369 INFO L290 TraceCheckUtils]: 82: Hoare triple {48977#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {48976#false} is VALID [2022-02-20 19:51:21,369 INFO L290 TraceCheckUtils]: 83: Hoare triple {48976#false} assume !(node7_~m7~0#1 != ~nomsg~0); {48976#false} is VALID [2022-02-20 19:51:21,369 INFO L290 TraceCheckUtils]: 84: Hoare triple {48976#false} ~mode7~0 := 0; {48976#false} is VALID [2022-02-20 19:51:21,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {48976#false} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {48976#false} is VALID [2022-02-20 19:51:21,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {48976#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {48976#false} is VALID [2022-02-20 19:51:21,369 INFO L290 TraceCheckUtils]: 87: Hoare triple {48976#false} check_#res#1 := check_~tmp~1#1; {48976#false} is VALID [2022-02-20 19:51:21,370 INFO L290 TraceCheckUtils]: 88: Hoare triple {48976#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {48976#false} is VALID [2022-02-20 19:51:21,370 INFO L290 TraceCheckUtils]: 89: Hoare triple {48976#false} assume 0 == assert_~arg#1 % 256; {48976#false} is VALID [2022-02-20 19:51:21,370 INFO L290 TraceCheckUtils]: 90: Hoare triple {48976#false} assume !false; {48976#false} is VALID [2022-02-20 19:51:21,370 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 19:51:21,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:21,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28476569] [2022-02-20 19:51:21,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28476569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:21,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:21,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:51:21,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123508645] [2022-02-20 19:51:21,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:21,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:21,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:21,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:21,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:21,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:51:21,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:51:21,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:51:21,433 INFO L87 Difference]: Start difference. First operand 2459 states and 3883 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:23,940 INFO L93 Difference]: Finished difference Result 4159 states and 6541 transitions. [2022-02-20 19:51:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:51:23,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:51:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1818 transitions. [2022-02-20 19:51:23,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1818 transitions. [2022-02-20 19:51:25,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1818 edges. 1818 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:25,796 INFO L225 Difference]: With dead ends: 4159 [2022-02-20 19:51:25,796 INFO L226 Difference]: Without dead ends: 3261 [2022-02-20 19:51:25,797 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 19:51:25,798 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1787 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 19:51:25,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1516 Valid, 1787 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:51:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2022-02-20 19:51:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3259. [2022-02-20 19:51:25,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:51:25,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.5704636168252994) internal successors, (5115), 3258 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:25,996 INFO L74 IsIncluded]: Start isIncluded. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.5704636168252994) internal successors, (5115), 3258 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:25,998 INFO L87 Difference]: Start difference. First operand 3261 states. Second operand has 3259 states, 3257 states have (on average 1.5704636168252994) internal successors, (5115), 3258 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:26,305 INFO L93 Difference]: Finished difference Result 3261 states and 5116 transitions. [2022-02-20 19:51:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 5116 transitions. [2022-02-20 19:51:26,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:26,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:26,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 3259 states, 3257 states have (on average 1.5704636168252994) internal successors, (5115), 3258 states have internal predecessors, (5115), 0 states have call successors, (0), 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 3261 states. [2022-02-20 19:51:26,313 INFO L87 Difference]: Start difference. First operand has 3259 states, 3257 states have (on average 1.5704636168252994) internal successors, (5115), 3258 states have internal predecessors, (5115), 0 states have call successors, (0), 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 3261 states. [2022-02-20 19:51:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:51:26,604 INFO L93 Difference]: Finished difference Result 3261 states and 5116 transitions. [2022-02-20 19:51:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3261 states and 5116 transitions. [2022-02-20 19:51:26,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:51:26,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:51:26,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:51:26,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:51:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 3257 states have (on average 1.5704636168252994) internal successors, (5115), 3258 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5115 transitions. [2022-02-20 19:51:26,971 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5115 transitions. Word has length 91 [2022-02-20 19:51:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:51:26,972 INFO L470 AbstractCegarLoop]: Abstraction has 3259 states and 5115 transitions. [2022-02-20 19:51:26,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5115 transitions. [2022-02-20 19:51:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 19:51:26,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:51:26,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:51:26,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:51:26,973 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:51:26,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:51:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1109178805, now seen corresponding path program 1 times [2022-02-20 19:51:26,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:51:26,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426381101] [2022-02-20 19:51:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:51:26,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:51:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:51:27,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {63742#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {63742#true} is VALID [2022-02-20 19:51:27,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {63742#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet57#1, main_#t~ret58#1, main_#t~ret59#1;assume -2147483648 <= main_#t~nondet57#1 && main_#t~nondet57#1 <= 2147483647; {63742#true} is VALID [2022-02-20 19:51:27,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {63742#true} assume 0 != main_#t~nondet57#1;havoc main_#t~nondet57#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~ret41#1, main1_#t~ret42#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~id3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~st3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~send3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;~mode3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~id4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~st4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~send4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;~mode4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~id5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~st5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~send5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;~mode5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~id6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~st6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~send6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;~mode6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;assume -128 <= main1_#t~nondet37#1 && main1_#t~nondet37#1 <= 127;~id7~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~st7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~send7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;~mode7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {63742#true} is VALID [2022-02-20 19:51:27,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {63742#true} assume 0 == ~r1~0 % 256; {63742#true} is VALID [2022-02-20 19:51:27,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {63742#true} assume ~id1~0 >= 0; {63742#true} is VALID [2022-02-20 19:51:27,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {63742#true} assume 0 == ~st1~0; {63744#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:27,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {63744#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {63744#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:27,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {63744#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {63744#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:27,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {63744#(<= ~st1~0 0)} assume ~id2~0 >= 0; {63744#(<= ~st1~0 0)} is VALID [2022-02-20 19:51:27,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {63744#(<= ~st1~0 0)} assume 0 == ~st2~0; {63745#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {63745#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {63745#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {63745#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {63745#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {63745#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {63745#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {63745#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {63746#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {63747#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:51:27,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {63748#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {63749#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} main1_#t~ret41#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret41#1 && main1_#t~ret41#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret41#1;havoc main1_#t~ret41#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main1_~i2~0#1 := 0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,100 INFO L290 TraceCheckUtils]: 76: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,102 INFO L290 TraceCheckUtils]: 81: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,102 INFO L290 TraceCheckUtils]: 82: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,102 INFO L290 TraceCheckUtils]: 83: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,103 INFO L290 TraceCheckUtils]: 84: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,103 INFO L290 TraceCheckUtils]: 85: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node7 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:51:27,103 INFO L290 TraceCheckUtils]: 86: Hoare triple {63750#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; {63743#false} is VALID [2022-02-20 19:51:27,104 INFO L290 TraceCheckUtils]: 87: Hoare triple {63743#false} check_#res#1 := check_~tmp~1#1; {63743#false} is VALID [2022-02-20 19:51:27,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {63743#false} main1_#t~ret42#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret42#1 && main1_#t~ret42#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret42#1;havoc main1_#t~ret42#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {63743#false} is VALID [2022-02-20 19:51:27,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {63743#false} assume 0 == assert_~arg#1 % 256; {63743#false} is VALID [2022-02-20 19:51:27,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {63743#false} assume !false; {63743#false} is VALID [2022-02-20 19:51:27,104 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 19:51:27,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:51:27,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426381101] [2022-02-20 19:51:27,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426381101] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:51:27,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:51:27,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:51:27,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573580209] [2022-02-20 19:51:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:51:27,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-02-20 19:51:27,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:51:27,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:51:27,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:51:27,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:51:27,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:51:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:51:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:51:27,162 INFO L87 Difference]: Start difference. First operand 3259 states and 5115 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)