./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:30:15,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:30:15,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:30:15,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:30:15,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:30:15,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:30:15,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:30:15,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:30:15,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:30:15,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:30:15,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:30:15,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:30:15,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:30:15,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:30:15,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:30:15,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:30:15,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:30:15,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:30:15,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:30:15,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:30:15,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:30:15,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:30:15,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:30:15,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:30:15,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:30:15,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:30:15,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:30:15,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:30:15,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:30:15,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:30:15,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:30:15,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:30:15,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:30:15,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:30:15,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:30:15,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:30:15,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:30:15,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:30:15,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:30:15,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:30:15,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:30:15,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:30:15,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:30:15,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:30:15,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:30:15,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:30:15,106 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:30:15,106 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:30:15,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:30:15,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:30:15,108 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:30:15,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:30:15,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:30:15,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:30:15,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:30:15,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:30:15,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:30:15,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:30:15,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:30:15,109 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:30:15,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:30:15,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:30:15,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:30:15,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:30:15,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:30:15,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:30:15,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:15,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:30:15,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:30:15,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:30:15,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:30:15,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:30:15,112 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:30:15,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:30:15,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:30:15,113 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 -> 2e89791a2e8bde62b11f5e3f45edc8f6b1d8831a0e105552a6da22a3ff44c454 [2022-02-20 18:30:15,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:30:15,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:30:15,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:30:15,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:30:15,352 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:30:15,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:15,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e41a625/613e92d00e694d28a34fe33249344a27/FLAG0d3b5637a [2022-02-20 18:30:15,758 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:30:15,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:15,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e41a625/613e92d00e694d28a34fe33249344a27/FLAG0d3b5637a [2022-02-20 18:30:15,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e41a625/613e92d00e694d28a34fe33249344a27 [2022-02-20 18:30:15,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:30:15,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:30:15,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:15,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:30:15,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:30:15,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:15" (1/1) ... [2022-02-20 18:30:15,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b280103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:15, skipping insertion in model container [2022-02-20 18:30:15,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:15" (1/1) ... [2022-02-20 18:30:15,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:30:15,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:30:16,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2022-02-20 18:30:16,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:16,082 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:30:16,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c[15177,15190] [2022-02-20 18:30:16,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:16,161 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:30:16,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16 WrapperNode [2022-02-20 18:30:16,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:16,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:16,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:30:16,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:30:16,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,227 INFO L137 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 388 [2022-02-20 18:30:16,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:16,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:30:16,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:30:16,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:30:16,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:30:16,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:30:16,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:30:16,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:30:16,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (1/1) ... [2022-02-20 18:30:16,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:30:16,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:30:16,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:30:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:30:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:30:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:30:16,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:30:16,422 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:30:16,423 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:30:16,959 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:30:16,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:30:16,966 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:30:16,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:16 BoogieIcfgContainer [2022-02-20 18:30:16,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:30:16,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:30:16,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:30:16,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:30:16,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:30:15" (1/3) ... [2022-02-20 18:30:16,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e1f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:16, skipping insertion in model container [2022-02-20 18:30:16,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:16" (2/3) ... [2022-02-20 18:30:16,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e1f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:16, skipping insertion in model container [2022-02-20 18:30:16,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:16" (3/3) ... [2022-02-20 18:30:16,974 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals.c [2022-02-20 18:30:16,979 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:30:16,980 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:30:17,013 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:30:17,021 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:30:17,022 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:30:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 109 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:30:17,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:17,040 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] [2022-02-20 18:30:17,041 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1259035486, now seen corresponding path program 1 times [2022-02-20 18:30:17,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:17,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521631519] [2022-02-20 18:30:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:17,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {113#true} is VALID [2022-02-20 18:30:17,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {113#true} is VALID [2022-02-20 18:30:17,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {113#true} is VALID [2022-02-20 18:30:17,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#true} init_#res#1 := init_~tmp~0#1; {113#true} is VALID [2022-02-20 18:30:17,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {113#true} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {113#true} is VALID [2022-02-20 18:30:17,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {114#false} is VALID [2022-02-20 18:30:17,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {114#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;main_~i2~0#1 := 0; {114#false} is VALID [2022-02-20 18:30:17,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {114#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {114#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {114#false} assume !(node1_~m1~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:17,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {114#false} ~mode1~0 := 0; {114#false} is VALID [2022-02-20 18:30:17,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {114#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {114#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {114#false} assume !(node2_~m2~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:17,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {114#false} ~mode2~0 := 0; {114#false} is VALID [2022-02-20 18:30:17,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {114#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {114#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {114#false} assume !(node3_~m3~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:17,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {114#false} ~mode3~0 := 0; {114#false} is VALID [2022-02-20 18:30:17,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {114#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {114#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {114#false} assume !(node4_~m4~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:17,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {114#false} ~mode4~0 := 0; {114#false} is VALID [2022-02-20 18:30:17,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {114#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {114#false} assume !(0 != ~mode5~0 % 256); {114#false} is VALID [2022-02-20 18:30:17,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {114#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {114#false} is VALID [2022-02-20 18:30:17,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {114#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {114#false} is VALID [2022-02-20 18:30:17,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {114#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:17,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {114#false} assume !(0 != ~mode6~0 % 256); {114#false} is VALID [2022-02-20 18:30:17,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {114#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {114#false} is VALID [2022-02-20 18:30:17,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {114#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {114#false} is VALID [2022-02-20 18:30:17,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {114#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {114#false} is VALID [2022-02-20 18:30:17,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {114#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {114#false} is VALID [2022-02-20 18:30:17,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {114#false} check_#res#1 := check_~tmp~1#1; {114#false} is VALID [2022-02-20 18:30:17,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {114#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {114#false} is VALID [2022-02-20 18:30:17,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {114#false} assume 0 == assert_~arg#1 % 256; {114#false} is VALID [2022-02-20 18:30:17,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {114#false} assume !false; {114#false} is VALID [2022-02-20 18:30:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:17,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:17,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521631519] [2022-02-20 18:30:17,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521631519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:17,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:17,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:30:17,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327414047] [2022-02-20 18:30:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:17,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:17,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:17,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:30:17,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:17,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:30:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:17,286 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 109 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:17,420 INFO L93 Difference]: Finished difference Result 171 states and 287 transitions. [2022-02-20 18:30:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:30:17,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-02-20 18:30:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-02-20 18:30:17,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 287 transitions. [2022-02-20 18:30:17,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:17,646 INFO L225 Difference]: With dead ends: 171 [2022-02-20 18:30:17,646 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 18:30:17,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:17,651 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:17,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 18:30:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 18:30:17,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:17,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,682 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,682 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:17,687 INFO L93 Difference]: Finished difference Result 106 states and 181 transitions. [2022-02-20 18:30:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 181 transitions. [2022-02-20 18:30:17,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:17,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:17,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 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 106 states. [2022-02-20 18:30:17,688 INFO L87 Difference]: Start difference. First operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 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 106 states. [2022-02-20 18:30:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:17,691 INFO L93 Difference]: Finished difference Result 106 states and 181 transitions. [2022-02-20 18:30:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 181 transitions. [2022-02-20 18:30:17,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:17,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:17,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:17,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 181 transitions. [2022-02-20 18:30:17,696 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 181 transitions. Word has length 37 [2022-02-20 18:30:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:17,697 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 181 transitions. [2022-02-20 18:30:17,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 181 transitions. [2022-02-20 18:30:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:30:17,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:17,698 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] [2022-02-20 18:30:17,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:30:17,699 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1533795100, now seen corresponding path program 1 times [2022-02-20 18:30:17,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:17,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915531487] [2022-02-20 18:30:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:17,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {636#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {636#true} is VALID [2022-02-20 18:30:17,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {636#true} is VALID [2022-02-20 18:30:17,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {638#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:30:17,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {638#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {639#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:30:17,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {639#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {640#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:30:17,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {640#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {637#false} is VALID [2022-02-20 18:30:17,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {637#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;main_~i2~0#1 := 0; {637#false} is VALID [2022-02-20 18:30:17,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {637#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {637#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {637#false} assume !(node1_~m1~0#1 != ~nomsg~0); {637#false} is VALID [2022-02-20 18:30:17,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {637#false} ~mode1~0 := 0; {637#false} is VALID [2022-02-20 18:30:17,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#false} assume !(node2_~m2~0#1 != ~nomsg~0); {637#false} is VALID [2022-02-20 18:30:17,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {637#false} ~mode2~0 := 0; {637#false} is VALID [2022-02-20 18:30:17,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {637#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {637#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {637#false} assume !(node3_~m3~0#1 != ~nomsg~0); {637#false} is VALID [2022-02-20 18:30:17,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {637#false} ~mode3~0 := 0; {637#false} is VALID [2022-02-20 18:30:17,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {637#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {637#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {637#false} assume !(node4_~m4~0#1 != ~nomsg~0); {637#false} is VALID [2022-02-20 18:30:17,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {637#false} ~mode4~0 := 0; {637#false} is VALID [2022-02-20 18:30:17,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {637#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {637#false} assume !(0 != ~mode5~0 % 256); {637#false} is VALID [2022-02-20 18:30:17,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {637#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {637#false} is VALID [2022-02-20 18:30:17,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {637#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {637#false} is VALID [2022-02-20 18:30:17,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {637#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {637#false} is VALID [2022-02-20 18:30:17,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {637#false} assume !(0 != ~mode6~0 % 256); {637#false} is VALID [2022-02-20 18:30:17,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {637#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {637#false} is VALID [2022-02-20 18:30:17,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {637#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {637#false} is VALID [2022-02-20 18:30:17,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {637#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {637#false} is VALID [2022-02-20 18:30:17,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {637#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {637#false} is VALID [2022-02-20 18:30:17,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {637#false} check_#res#1 := check_~tmp~1#1; {637#false} is VALID [2022-02-20 18:30:17,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {637#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {637#false} is VALID [2022-02-20 18:30:17,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {637#false} assume 0 == assert_~arg#1 % 256; {637#false} is VALID [2022-02-20 18:30:17,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-02-20 18:30:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:17,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:17,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915531487] [2022-02-20 18:30:17,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915531487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:17,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:17,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:30:17,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956835625] [2022-02-20 18:30:17,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:17,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:17,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:17,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:17,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:17,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:30:17,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:30:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:30:17,818 INFO L87 Difference]: Start difference. First operand 106 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:18,161 INFO L93 Difference]: Finished difference Result 170 states and 280 transitions. [2022-02-20 18:30:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:30:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:30:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2022-02-20 18:30:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2022-02-20 18:30:18,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 280 transitions. [2022-02-20 18:30:18,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:18,358 INFO L225 Difference]: With dead ends: 170 [2022-02-20 18:30:18,358 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 18:30:18,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:18,359 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:18,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 673 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 18:30:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 18:30:18,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:18,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,364 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,364 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:18,366 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2022-02-20 18:30:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 18:30:18,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:18,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:18,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 0 states have call successors, (0), 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 106 states. [2022-02-20 18:30:18,368 INFO L87 Difference]: Start difference. First operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 0 states have call successors, (0), 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 106 states. [2022-02-20 18:30:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:18,370 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2022-02-20 18:30:18,370 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 18:30:18,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:18,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:18,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:18,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 141 transitions. [2022-02-20 18:30:18,374 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 141 transitions. Word has length 37 [2022-02-20 18:30:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:18,374 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 141 transitions. [2022-02-20 18:30:18,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 18:30:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:18,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:18,376 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] [2022-02-20 18:30:18,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:30:18,376 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:18,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1950823117, now seen corresponding path program 1 times [2022-02-20 18:30:18,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:18,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117787126] [2022-02-20 18:30:18,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:18,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:18,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {1165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {1165#true} is VALID [2022-02-20 18:30:18,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1165#true} is VALID [2022-02-20 18:30:18,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume 0 == ~r1~0 % 256; {1165#true} is VALID [2022-02-20 18:30:18,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {1165#true} assume ~id1~0 >= 0; {1165#true} is VALID [2022-02-20 18:30:18,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {1165#true} assume 0 == ~st1~0; {1165#true} is VALID [2022-02-20 18:30:18,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} assume ~send1~0 == ~id1~0; {1165#true} is VALID [2022-02-20 18:30:18,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {1165#true} assume 0 == ~mode1~0 % 256; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:18,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {1167#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {1166#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1166#false} is VALID [2022-02-20 18:30:18,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {1166#false} ~mode1~0 := 0; {1166#false} is VALID [2022-02-20 18:30:18,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {1166#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {1166#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,534 INFO L290 TraceCheckUtils]: 52: Hoare triple {1166#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1166#false} is VALID [2022-02-20 18:30:18,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {1166#false} ~mode2~0 := 0; {1166#false} is VALID [2022-02-20 18:30:18,534 INFO L290 TraceCheckUtils]: 54: Hoare triple {1166#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {1166#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {1166#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1166#false} is VALID [2022-02-20 18:30:18,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {1166#false} ~mode3~0 := 0; {1166#false} is VALID [2022-02-20 18:30:18,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {1166#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,535 INFO L290 TraceCheckUtils]: 59: Hoare triple {1166#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {1166#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1166#false} is VALID [2022-02-20 18:30:18,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {1166#false} ~mode4~0 := 0; {1166#false} is VALID [2022-02-20 18:30:18,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {1166#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {1166#false} assume !(0 != ~mode5~0 % 256); {1166#false} is VALID [2022-02-20 18:30:18,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {1166#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1166#false} is VALID [2022-02-20 18:30:18,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {1166#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1166#false} is VALID [2022-02-20 18:30:18,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {1166#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1166#false} is VALID [2022-02-20 18:30:18,536 INFO L290 TraceCheckUtils]: 67: Hoare triple {1166#false} assume !(0 != ~mode6~0 % 256); {1166#false} is VALID [2022-02-20 18:30:18,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {1166#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1166#false} is VALID [2022-02-20 18:30:18,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {1166#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1166#false} is VALID [2022-02-20 18:30:18,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {1166#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1166#false} is VALID [2022-02-20 18:30:18,537 INFO L290 TraceCheckUtils]: 71: Hoare triple {1166#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1166#false} is VALID [2022-02-20 18:30:18,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {1166#false} check_#res#1 := check_~tmp~1#1; {1166#false} is VALID [2022-02-20 18:30:18,537 INFO L290 TraceCheckUtils]: 73: Hoare triple {1166#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1166#false} is VALID [2022-02-20 18:30:18,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {1166#false} assume 0 == assert_~arg#1 % 256; {1166#false} is VALID [2022-02-20 18:30:18,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-02-20 18:30:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:18,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:18,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117787126] [2022-02-20 18:30:18,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117787126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:18,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:18,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:18,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403875680] [2022-02-20 18:30:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:18,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:18,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:18,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:18,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:18,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:18,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:18,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:18,601 INFO L87 Difference]: Start difference. First operand 106 states and 141 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:18,769 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2022-02-20 18:30:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:18,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:18,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:18,963 INFO L225 Difference]: With dead ends: 220 [2022-02-20 18:30:18,963 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 18:30:18,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:18,965 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 85 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:18,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 315 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 18:30:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-02-20 18:30:18,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:18,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,972 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,972 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:18,980 INFO L93 Difference]: Finished difference Result 160 states and 225 transitions. [2022-02-20 18:30:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 225 transitions. [2022-02-20 18:30:18,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:18,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:18,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 0 states have call successors, (0), 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 160 states. [2022-02-20 18:30:18,982 INFO L87 Difference]: Start difference. First operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 0 states have call successors, (0), 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 160 states. [2022-02-20 18:30:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:18,988 INFO L93 Difference]: Finished difference Result 160 states and 225 transitions. [2022-02-20 18:30:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 225 transitions. [2022-02-20 18:30:18,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:18,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:18,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:18,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 224 transitions. [2022-02-20 18:30:18,992 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 224 transitions. Word has length 76 [2022-02-20 18:30:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:18,992 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 224 transitions. [2022-02-20 18:30:18,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 224 transitions. [2022-02-20 18:30:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:18,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:18,994 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] [2022-02-20 18:30:18,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:30:18,994 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 699917825, now seen corresponding path program 1 times [2022-02-20 18:30:18,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:18,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456488721] [2022-02-20 18:30:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:19,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {1915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {1915#true} is VALID [2022-02-20 18:30:19,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1915#true} is VALID [2022-02-20 18:30:19,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {1915#true} assume 0 == ~r1~0 % 256; {1915#true} is VALID [2022-02-20 18:30:19,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {1915#true} assume ~id1~0 >= 0; {1915#true} is VALID [2022-02-20 18:30:19,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {1915#true} assume 0 == ~st1~0; {1915#true} is VALID [2022-02-20 18:30:19,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {1915#true} assume ~send1~0 == ~id1~0; {1915#true} is VALID [2022-02-20 18:30:19,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {1915#true} assume 0 == ~mode1~0 % 256; {1915#true} is VALID [2022-02-20 18:30:19,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1915#true} assume ~id2~0 >= 0; {1915#true} is VALID [2022-02-20 18:30:19,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {1915#true} assume 0 == ~st2~0; {1915#true} is VALID [2022-02-20 18:30:19,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {1915#true} assume ~send2~0 == ~id2~0; {1915#true} is VALID [2022-02-20 18:30:19,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {1915#true} assume 0 == ~mode2~0 % 256; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:19,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {1917#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1916#false} is VALID [2022-02-20 18:30:19,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {1916#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1916#false} is VALID [2022-02-20 18:30:19,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {1916#false} ~mode2~0 := 0; {1916#false} is VALID [2022-02-20 18:30:19,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {1916#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1916#false} is VALID [2022-02-20 18:30:19,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {1916#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1916#false} is VALID [2022-02-20 18:30:19,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {1916#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1916#false} is VALID [2022-02-20 18:30:19,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {1916#false} ~mode3~0 := 0; {1916#false} is VALID [2022-02-20 18:30:19,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {1916#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1916#false} is VALID [2022-02-20 18:30:19,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {1916#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1916#false} is VALID [2022-02-20 18:30:19,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {1916#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1916#false} is VALID [2022-02-20 18:30:19,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {1916#false} ~mode4~0 := 0; {1916#false} is VALID [2022-02-20 18:30:19,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {1916#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1916#false} is VALID [2022-02-20 18:30:19,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {1916#false} assume !(0 != ~mode5~0 % 256); {1916#false} is VALID [2022-02-20 18:30:19,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {1916#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1916#false} is VALID [2022-02-20 18:30:19,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {1916#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1916#false} is VALID [2022-02-20 18:30:19,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {1916#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1916#false} is VALID [2022-02-20 18:30:19,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {1916#false} assume !(0 != ~mode6~0 % 256); {1916#false} is VALID [2022-02-20 18:30:19,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {1916#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1916#false} is VALID [2022-02-20 18:30:19,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {1916#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1916#false} is VALID [2022-02-20 18:30:19,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {1916#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1916#false} is VALID [2022-02-20 18:30:19,095 INFO L290 TraceCheckUtils]: 71: Hoare triple {1916#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1916#false} is VALID [2022-02-20 18:30:19,095 INFO L290 TraceCheckUtils]: 72: Hoare triple {1916#false} check_#res#1 := check_~tmp~1#1; {1916#false} is VALID [2022-02-20 18:30:19,095 INFO L290 TraceCheckUtils]: 73: Hoare triple {1916#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1916#false} is VALID [2022-02-20 18:30:19,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {1916#false} assume 0 == assert_~arg#1 % 256; {1916#false} is VALID [2022-02-20 18:30:19,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {1916#false} assume !false; {1916#false} is VALID [2022-02-20 18:30:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:19,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:19,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456488721] [2022-02-20 18:30:19,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456488721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:19,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:19,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:19,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888162334] [2022-02-20 18:30:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:19,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:19,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:19,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:19,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:19,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:19,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:19,144 INFO L87 Difference]: Start difference. First operand 158 states and 224 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:19,318 INFO L93 Difference]: Finished difference Result 370 states and 560 transitions. [2022-02-20 18:30:19,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:19,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:19,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:19,534 INFO L225 Difference]: With dead ends: 370 [2022-02-20 18:30:19,535 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 18:30:19,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:19,536 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 81 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:19,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 18:30:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2022-02-20 18:30:19,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:19,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,548 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,548 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:19,553 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-02-20 18:30:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-02-20 18:30:19,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:19,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:19,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 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 258 states. [2022-02-20 18:30:19,555 INFO L87 Difference]: Start difference. First operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 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 258 states. [2022-02-20 18:30:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:19,570 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-02-20 18:30:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-02-20 18:30:19,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:19,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:19,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:19,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2022-02-20 18:30:19,576 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 76 [2022-02-20 18:30:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:19,577 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2022-02-20 18:30:19,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2022-02-20 18:30:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:19,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:19,578 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] [2022-02-20 18:30:19,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:30:19,578 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash -45664905, now seen corresponding path program 1 times [2022-02-20 18:30:19,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:19,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238644290] [2022-02-20 18:30:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:19,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {3154#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {3154#true} is VALID [2022-02-20 18:30:19,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {3154#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {3154#true} assume 0 == ~r1~0 % 256; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {3154#true} assume ~id1~0 >= 0; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {3154#true} assume 0 == ~st1~0; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {3154#true} assume ~send1~0 == ~id1~0; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {3154#true} assume 0 == ~mode1~0 % 256; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3154#true} assume ~id2~0 >= 0; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3154#true} assume 0 == ~st2~0; {3154#true} is VALID [2022-02-20 18:30:19,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {3154#true} assume ~send2~0 == ~id2~0; {3154#true} is VALID [2022-02-20 18:30:19,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {3154#true} assume 0 == ~mode2~0 % 256; {3154#true} is VALID [2022-02-20 18:30:19,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {3154#true} assume ~id3~0 >= 0; {3154#true} is VALID [2022-02-20 18:30:19,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3154#true} assume 0 == ~st3~0; {3154#true} is VALID [2022-02-20 18:30:19,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {3154#true} assume ~send3~0 == ~id3~0; {3154#true} is VALID [2022-02-20 18:30:19,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {3154#true} assume 0 == ~mode3~0 % 256; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {3156#(= (+ (* (- 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;main_~i2~0#1 := 0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,685 INFO L290 TraceCheckUtils]: 53: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,685 INFO L290 TraceCheckUtils]: 54: Hoare triple {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3156#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:19,687 INFO L290 TraceCheckUtils]: 55: Hoare triple {3156#(= (+ (* (- 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; {3155#false} is VALID [2022-02-20 18:30:19,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {3155#false} assume !(node3_~m3~0#1 != ~nomsg~0); {3155#false} is VALID [2022-02-20 18:30:19,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {3155#false} ~mode3~0 := 0; {3155#false} is VALID [2022-02-20 18:30:19,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {3155#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3155#false} is VALID [2022-02-20 18:30:19,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {3155#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3155#false} is VALID [2022-02-20 18:30:19,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {3155#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3155#false} is VALID [2022-02-20 18:30:19,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {3155#false} ~mode4~0 := 0; {3155#false} is VALID [2022-02-20 18:30:19,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {3155#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3155#false} is VALID [2022-02-20 18:30:19,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {3155#false} assume !(0 != ~mode5~0 % 256); {3155#false} is VALID [2022-02-20 18:30:19,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {3155#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {3155#false} is VALID [2022-02-20 18:30:19,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {3155#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {3155#false} is VALID [2022-02-20 18:30:19,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {3155#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3155#false} is VALID [2022-02-20 18:30:19,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {3155#false} assume !(0 != ~mode6~0 % 256); {3155#false} is VALID [2022-02-20 18:30:19,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {3155#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {3155#false} is VALID [2022-02-20 18:30:19,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {3155#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {3155#false} is VALID [2022-02-20 18:30:19,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {3155#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3155#false} is VALID [2022-02-20 18:30:19,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {3155#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {3155#false} is VALID [2022-02-20 18:30:19,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {3155#false} check_#res#1 := check_~tmp~1#1; {3155#false} is VALID [2022-02-20 18:30:19,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {3155#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3155#false} is VALID [2022-02-20 18:30:19,689 INFO L290 TraceCheckUtils]: 74: Hoare triple {3155#false} assume 0 == assert_~arg#1 % 256; {3155#false} is VALID [2022-02-20 18:30:19,689 INFO L290 TraceCheckUtils]: 75: Hoare triple {3155#false} assume !false; {3155#false} is VALID [2022-02-20 18:30:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:19,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:19,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238644290] [2022-02-20 18:30:19,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238644290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:19,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:19,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:19,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766110830] [2022-02-20 18:30:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:19,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:19,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:19,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:19,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:19,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:19,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:19,739 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:19,918 INFO L93 Difference]: Finished difference Result 652 states and 1005 transitions. [2022-02-20 18:30:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:19,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:19,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:19,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:20,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:20,133 INFO L225 Difference]: With dead ends: 652 [2022-02-20 18:30:20,134 INFO L226 Difference]: Without dead ends: 442 [2022-02-20 18:30:20,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:20,135 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 77 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:20,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 313 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-02-20 18:30:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2022-02-20 18:30:20,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:20,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,156 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,157 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,169 INFO L93 Difference]: Finished difference Result 442 states and 668 transitions. [2022-02-20 18:30:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 668 transitions. [2022-02-20 18:30:20,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:20,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:20,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 0 states have call successors, (0), 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 442 states. [2022-02-20 18:30:20,172 INFO L87 Difference]: Start difference. First operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 0 states have call successors, (0), 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 442 states. [2022-02-20 18:30:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,182 INFO L93 Difference]: Finished difference Result 442 states and 668 transitions. [2022-02-20 18:30:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 668 transitions. [2022-02-20 18:30:20,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:20,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:20,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:20,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 667 transitions. [2022-02-20 18:30:20,193 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 667 transitions. Word has length 76 [2022-02-20 18:30:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:20,193 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 667 transitions. [2022-02-20 18:30:20,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 667 transitions. [2022-02-20 18:30:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:20,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:20,194 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] [2022-02-20 18:30:20,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:30:20,194 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:20,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1985695763, now seen corresponding path program 1 times [2022-02-20 18:30:20,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:20,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847458264] [2022-02-20 18:30:20,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:20,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:20,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {5317#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {5317#true} is VALID [2022-02-20 18:30:20,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {5317#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5317#true} is VALID [2022-02-20 18:30:20,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {5317#true} assume 0 == ~r1~0 % 256; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {5317#true} assume ~id1~0 >= 0; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {5317#true} assume 0 == ~st1~0; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {5317#true} assume ~send1~0 == ~id1~0; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {5317#true} assume 0 == ~mode1~0 % 256; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {5317#true} assume ~id2~0 >= 0; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {5317#true} assume 0 == ~st2~0; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {5317#true} assume ~send2~0 == ~id2~0; {5317#true} is VALID [2022-02-20 18:30:20,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {5317#true} assume 0 == ~mode2~0 % 256; {5317#true} is VALID [2022-02-20 18:30:20,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {5317#true} assume ~id3~0 >= 0; {5317#true} is VALID [2022-02-20 18:30:20,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {5317#true} assume 0 == ~st3~0; {5317#true} is VALID [2022-02-20 18:30:20,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {5317#true} assume ~send3~0 == ~id3~0; {5317#true} is VALID [2022-02-20 18:30:20,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {5317#true} assume 0 == ~mode3~0 % 256; {5317#true} is VALID [2022-02-20 18:30:20,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {5317#true} assume ~id4~0 >= 0; {5317#true} is VALID [2022-02-20 18:30:20,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {5317#true} assume 0 == ~st4~0; {5317#true} is VALID [2022-02-20 18:30:20,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {5317#true} assume ~send4~0 == ~id4~0; {5317#true} is VALID [2022-02-20 18:30:20,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {5317#true} assume 0 == ~mode4~0 % 256; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,260 INFO L290 TraceCheckUtils]: 40: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,260 INFO L290 TraceCheckUtils]: 41: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,261 INFO L290 TraceCheckUtils]: 43: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {5319#(= (+ (* (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;main_~i2~0#1 := 0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5319#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:20,267 INFO L290 TraceCheckUtils]: 59: Hoare triple {5319#(= (+ (* (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; {5318#false} is VALID [2022-02-20 18:30:20,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {5318#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {5318#false} ~mode4~0 := 0; {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {5318#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {5318#false} assume !(0 != ~mode5~0 % 256); {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {5318#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {5318#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 66: Hoare triple {5318#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {5318#false} assume !(0 != ~mode6~0 % 256); {5318#false} is VALID [2022-02-20 18:30:20,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {5318#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {5318#false} is VALID [2022-02-20 18:30:20,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {5318#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {5318#false} is VALID [2022-02-20 18:30:20,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {5318#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5318#false} is VALID [2022-02-20 18:30:20,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {5318#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {5318#false} is VALID [2022-02-20 18:30:20,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {5318#false} check_#res#1 := check_~tmp~1#1; {5318#false} is VALID [2022-02-20 18:30:20,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {5318#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5318#false} is VALID [2022-02-20 18:30:20,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {5318#false} assume 0 == assert_~arg#1 % 256; {5318#false} is VALID [2022-02-20 18:30:20,269 INFO L290 TraceCheckUtils]: 75: Hoare triple {5318#false} assume !false; {5318#false} is VALID [2022-02-20 18:30:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:20,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:20,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847458264] [2022-02-20 18:30:20,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847458264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:20,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:20,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:20,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321295968] [2022-02-20 18:30:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:20,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:20,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:20,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:20,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:20,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:20,316 INFO L87 Difference]: Start difference. First operand 440 states and 667 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,522 INFO L93 Difference]: Finished difference Result 1180 states and 1829 transitions. [2022-02-20 18:30:20,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:20,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:20,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:20,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:20,751 INFO L225 Difference]: With dead ends: 1180 [2022-02-20 18:30:20,751 INFO L226 Difference]: Without dead ends: 786 [2022-02-20 18:30:20,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:20,753 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:20,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2022-02-20 18:30:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2022-02-20 18:30:20,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:20,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 786 states. Second operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,776 INFO L74 IsIncluded]: Start isIncluded. First operand 786 states. Second operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,777 INFO L87 Difference]: Start difference. First operand 786 states. Second operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,797 INFO L93 Difference]: Finished difference Result 786 states and 1200 transitions. [2022-02-20 18:30:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1200 transitions. [2022-02-20 18:30:20,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:20,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:20,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 0 states have call successors, (0), 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 786 states. [2022-02-20 18:30:20,801 INFO L87 Difference]: Start difference. First operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 0 states have call successors, (0), 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 786 states. [2022-02-20 18:30:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:20,821 INFO L93 Difference]: Finished difference Result 786 states and 1200 transitions. [2022-02-20 18:30:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1200 transitions. [2022-02-20 18:30:20,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:20,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:20,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:20,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1199 transitions. [2022-02-20 18:30:20,846 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1199 transitions. Word has length 76 [2022-02-20 18:30:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:20,846 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 1199 transitions. [2022-02-20 18:30:20,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1199 transitions. [2022-02-20 18:30:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:20,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:20,847 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] [2022-02-20 18:30:20,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:30:20,847 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 714986851, now seen corresponding path program 1 times [2022-02-20 18:30:20,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:20,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028098105] [2022-02-20 18:30:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:20,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {9220#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {9220#true} is VALID [2022-02-20 18:30:20,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {9220#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {9220#true} is VALID [2022-02-20 18:30:20,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {9220#true} assume 0 == ~r1~0 % 256; {9220#true} is VALID [2022-02-20 18:30:20,934 INFO L290 TraceCheckUtils]: 3: Hoare triple {9220#true} assume ~id1~0 >= 0; {9220#true} is VALID [2022-02-20 18:30:20,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {9220#true} assume 0 == ~st1~0; {9222#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:20,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {9222#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {9222#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:20,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {9222#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {9222#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:20,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {9222#(<= ~st1~0 0)} assume ~id2~0 >= 0; {9222#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:20,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {9222#(<= ~st1~0 0)} assume 0 == ~st2~0; {9223#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {9223#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {9223#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {9223#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {9223#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {9223#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {9223#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {9223#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {9224#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {9225#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:20,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {9226#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~i2~0#1 := 0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,953 INFO L290 TraceCheckUtils]: 47: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,954 INFO L290 TraceCheckUtils]: 50: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,957 INFO L290 TraceCheckUtils]: 59: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,957 INFO L290 TraceCheckUtils]: 60: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,957 INFO L290 TraceCheckUtils]: 61: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,958 INFO L290 TraceCheckUtils]: 62: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,959 INFO L290 TraceCheckUtils]: 66: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,959 INFO L290 TraceCheckUtils]: 67: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,960 INFO L290 TraceCheckUtils]: 68: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,960 INFO L290 TraceCheckUtils]: 69: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,960 INFO L290 TraceCheckUtils]: 70: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:20,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {9227#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {9221#false} is VALID [2022-02-20 18:30:20,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {9221#false} check_#res#1 := check_~tmp~1#1; {9221#false} is VALID [2022-02-20 18:30:20,961 INFO L290 TraceCheckUtils]: 73: Hoare triple {9221#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {9221#false} is VALID [2022-02-20 18:30:20,961 INFO L290 TraceCheckUtils]: 74: Hoare triple {9221#false} assume 0 == assert_~arg#1 % 256; {9221#false} is VALID [2022-02-20 18:30:20,961 INFO L290 TraceCheckUtils]: 75: Hoare triple {9221#false} assume !false; {9221#false} is VALID [2022-02-20 18:30:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:20,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:20,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028098105] [2022-02-20 18:30:20,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028098105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:20,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:20,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:30:20,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081709827] [2022-02-20 18:30:20,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:20,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:20,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:21,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:21,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:30:21,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:21,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:30:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:30:21,018 INFO L87 Difference]: Start difference. First operand 784 states and 1199 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:27,997 INFO L93 Difference]: Finished difference Result 9640 states and 15035 transitions. [2022-02-20 18:30:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:30:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:30:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1281 transitions. [2022-02-20 18:30:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1281 transitions. [2022-02-20 18:30:28,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 1281 transitions. [2022-02-20 18:30:28,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1281 edges. 1281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:31,231 INFO L225 Difference]: With dead ends: 9640 [2022-02-20 18:30:31,232 INFO L226 Difference]: Without dead ends: 8902 [2022-02-20 18:30:31,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:30:31,234 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 2232 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:31,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2232 Valid, 1240 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8902 states. [2022-02-20 18:30:31,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8902 to 1520. [2022-02-20 18:30:31,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:31,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8902 states. Second operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,973 INFO L74 IsIncluded]: Start isIncluded. First operand 8902 states. Second operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:31,975 INFO L87 Difference]: Start difference. First operand 8902 states. Second operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:33,839 INFO L93 Difference]: Finished difference Result 8902 states and 13690 transitions. [2022-02-20 18:30:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8902 states and 13690 transitions. [2022-02-20 18:30:33,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:33,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:33,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 0 states have call successors, (0), 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 8902 states. [2022-02-20 18:30:33,855 INFO L87 Difference]: Start difference. First operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 0 states have call successors, (0), 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 8902 states. [2022-02-20 18:30:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:35,909 INFO L93 Difference]: Finished difference Result 8902 states and 13690 transitions. [2022-02-20 18:30:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 8902 states and 13690 transitions. [2022-02-20 18:30:35,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:35,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:35,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:35,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2319 transitions. [2022-02-20 18:30:35,988 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2319 transitions. Word has length 76 [2022-02-20 18:30:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:35,988 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 2319 transitions. [2022-02-20 18:30:35,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2319 transitions. [2022-02-20 18:30:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:35,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:35,989 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] [2022-02-20 18:30:35,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:30:35,990 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1508096525, now seen corresponding path program 1 times [2022-02-20 18:30:35,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:35,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122256586] [2022-02-20 18:30:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:36,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {40375#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {40375#true} is VALID [2022-02-20 18:30:36,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {40375#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40375#true} is VALID [2022-02-20 18:30:36,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {40375#true} assume 0 == ~r1~0 % 256; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 >= 0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send1~0 == ~id1~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 >= 0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 == ~id2~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 >= 0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 == ~id3~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 >= 0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st4~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 == ~id4~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode4~0 % 256; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 >= 0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st5~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 == ~id5~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode5~0 % 256; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id6~0 >= 0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st6~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 == ~id6~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode6~0 % 256; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id2~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id3~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id4~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id5~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id1~0 != ~id6~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id3~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id4~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id5~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id2~0 != ~id6~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id4~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id5~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id3~0 != ~id6~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id5~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id4~0 != ~id6~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp~0#1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} 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;main_~i2~0#1 := 0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode2~0 % 256); {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode3~0 % 256); {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode4~0 % 256); {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode5~0 % 256); {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,070 INFO L290 TraceCheckUtils]: 67: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode6~0 % 256); {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,071 INFO L290 TraceCheckUtils]: 69: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,071 INFO L290 TraceCheckUtils]: 70: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,072 INFO L290 TraceCheckUtils]: 71: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:30:36,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {40377#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~r1~0 % 256 >= 6; {40376#false} is VALID [2022-02-20 18:30:36,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {40376#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {40376#false} is VALID [2022-02-20 18:30:36,072 INFO L290 TraceCheckUtils]: 74: Hoare triple {40376#false} check_#res#1 := check_~tmp~1#1; {40376#false} is VALID [2022-02-20 18:30:36,072 INFO L290 TraceCheckUtils]: 75: Hoare triple {40376#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {40376#false} is VALID [2022-02-20 18:30:36,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {40376#false} assume 0 == assert_~arg#1 % 256; {40376#false} is VALID [2022-02-20 18:30:36,073 INFO L290 TraceCheckUtils]: 77: Hoare triple {40376#false} assume !false; {40376#false} is VALID [2022-02-20 18:30:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:36,073 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:36,073 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122256586] [2022-02-20 18:30:36,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122256586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:36,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:36,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:36,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576287909] [2022-02-20 18:30:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:36,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:36,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:36,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:36,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:36,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:36,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:36,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:36,125 INFO L87 Difference]: Start difference. First operand 1520 states and 2319 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:37,636 INFO L93 Difference]: Finished difference Result 3694 states and 5667 transitions. [2022-02-20 18:30:37,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:37,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:37,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-02-20 18:30:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-02-20 18:30:37,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 322 transitions. [2022-02-20 18:30:37,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:37,995 INFO L225 Difference]: With dead ends: 3694 [2022-02-20 18:30:37,996 INFO L226 Difference]: Without dead ends: 2220 [2022-02-20 18:30:37,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:37,998 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:37,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 252 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2022-02-20 18:30:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2218. [2022-02-20 18:30:38,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:38,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:38,999 INFO L74 IsIncluded]: Start isIncluded. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:39,002 INFO L87 Difference]: Start difference. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:39,121 INFO L93 Difference]: Finished difference Result 2220 states and 3370 transitions. [2022-02-20 18:30:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3370 transitions. [2022-02-20 18:30:39,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:39,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:39,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 0 states have call successors, (0), 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 2220 states. [2022-02-20 18:30:39,131 INFO L87 Difference]: Start difference. First operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 0 states have call successors, (0), 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 2220 states. [2022-02-20 18:30:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:39,251 INFO L93 Difference]: Finished difference Result 2220 states and 3370 transitions. [2022-02-20 18:30:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3370 transitions. [2022-02-20 18:30:39,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:39,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:39,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:39,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3369 transitions. [2022-02-20 18:30:39,405 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3369 transitions. Word has length 78 [2022-02-20 18:30:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:39,405 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 3369 transitions. [2022-02-20 18:30:39,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3369 transitions. [2022-02-20 18:30:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:39,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:39,406 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] [2022-02-20 18:30:39,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:30:39,407 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1441603013, now seen corresponding path program 1 times [2022-02-20 18:30:39,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:39,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588947620] [2022-02-20 18:30:39,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:39,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:39,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {51872#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {51872#true} is VALID [2022-02-20 18:30:39,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {51872#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51872#true} is VALID [2022-02-20 18:30:39,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {51872#true} assume 0 == ~r1~0 % 256; {51872#true} is VALID [2022-02-20 18:30:39,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {51872#true} assume ~id1~0 >= 0; {51872#true} is VALID [2022-02-20 18:30:39,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {51872#true} assume 0 == ~st1~0; {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send1~0 == ~id1~0; {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode1~0 % 256; {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id2~0 >= 0; {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {51874#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st2~0; {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send2~0 == ~id2~0; {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode2~0 % 256; {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id3~0 >= 0; {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {51875#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st3~0; {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:39,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~send3~0 == ~id3~0; {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:39,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~mode3~0 % 256; {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:39,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~id4~0 >= 0; {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:39,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {51876#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~st4~0; {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send4~0 == ~id4~0; {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode4~0 % 256; {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id5~0 >= 0; {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {51877#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st5~0; {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send5~0 == ~id5~0; {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode5~0 % 256; {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id6~0 >= 0; {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:39,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {51878#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st6~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 == ~id6~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume 0 == ~mode6~0 % 256; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id2~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id3~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id4~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id5~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id6~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id3~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id4~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id5~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id6~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id4~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id5~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id6~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id5~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id6~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} init_#res#1 := init_~tmp~0#1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~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;main_~i2~0#1 := 0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode1~0 % 256); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode2~0 % 256); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,631 INFO L290 TraceCheckUtils]: 52: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,631 INFO L290 TraceCheckUtils]: 53: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,632 INFO L290 TraceCheckUtils]: 55: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode3~0 % 256); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,632 INFO L290 TraceCheckUtils]: 56: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,633 INFO L290 TraceCheckUtils]: 58: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode4~0 % 256); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,634 INFO L290 TraceCheckUtils]: 60: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode5~0 % 256); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode6~0 % 256); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,637 INFO L290 TraceCheckUtils]: 68: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,651 INFO L290 TraceCheckUtils]: 69: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(~r1~0 % 256 >= 6); {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:39,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {51879#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0);check_~tmp~1#1 := 0; {51873#false} is VALID [2022-02-20 18:30:39,653 INFO L290 TraceCheckUtils]: 74: Hoare triple {51873#false} check_#res#1 := check_~tmp~1#1; {51873#false} is VALID [2022-02-20 18:30:39,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {51873#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {51873#false} is VALID [2022-02-20 18:30:39,654 INFO L290 TraceCheckUtils]: 76: Hoare triple {51873#false} assume 0 == assert_~arg#1 % 256; {51873#false} is VALID [2022-02-20 18:30:39,654 INFO L290 TraceCheckUtils]: 77: Hoare triple {51873#false} assume !false; {51873#false} is VALID [2022-02-20 18:30:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:39,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:39,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588947620] [2022-02-20 18:30:39,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588947620] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:39,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:39,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:30:39,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297664559] [2022-02-20 18:30:39,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:39,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:39,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:39,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:39,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:39,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:30:39,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:39,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:30:39,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:30:39,714 INFO L87 Difference]: Start difference. First operand 2218 states and 3369 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:42,156 INFO L93 Difference]: Finished difference Result 4390 states and 6691 transitions. [2022-02-20 18:30:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:30:42,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 329 transitions. [2022-02-20 18:30:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 329 transitions. [2022-02-20 18:30:42,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 329 transitions. [2022-02-20 18:30:42,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:42,500 INFO L225 Difference]: With dead ends: 4390 [2022-02-20 18:30:42,500 INFO L226 Difference]: Without dead ends: 2220 [2022-02-20 18:30:42,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:30:42,502 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 521 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:42,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 632 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2022-02-20 18:30:43,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2218. [2022-02-20 18:30:43,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:43,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:43,581 INFO L74 IsIncluded]: Start isIncluded. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:43,584 INFO L87 Difference]: Start difference. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:43,712 INFO L93 Difference]: Finished difference Result 2220 states and 3346 transitions. [2022-02-20 18:30:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3346 transitions. [2022-02-20 18:30:43,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:43,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:43,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 0 states have call successors, (0), 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 2220 states. [2022-02-20 18:30:43,731 INFO L87 Difference]: Start difference. First operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 0 states have call successors, (0), 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 2220 states. [2022-02-20 18:30:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:43,900 INFO L93 Difference]: Finished difference Result 2220 states and 3346 transitions. [2022-02-20 18:30:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3346 transitions. [2022-02-20 18:30:43,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:43,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:43,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:43,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3345 transitions. [2022-02-20 18:30:44,050 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3345 transitions. Word has length 78 [2022-02-20 18:30:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:44,050 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 3345 transitions. [2022-02-20 18:30:44,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3345 transitions. [2022-02-20 18:30:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:44,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:44,051 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] [2022-02-20 18:30:44,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:30:44,051 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash 347311063, now seen corresponding path program 1 times [2022-02-20 18:30:44,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:44,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242298522] [2022-02-20 18:30:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:44,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {64214#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {64214#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {64214#true} assume 0 == ~r1~0 % 256; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {64214#true} assume ~id1~0 >= 0; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {64214#true} assume 0 == ~st1~0; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {64214#true} assume ~send1~0 == ~id1~0; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {64214#true} assume 0 == ~mode1~0 % 256; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {64214#true} assume ~id2~0 >= 0; {64214#true} is VALID [2022-02-20 18:30:44,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {64214#true} assume 0 == ~st2~0; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {64214#true} assume ~send2~0 == ~id2~0; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {64214#true} assume 0 == ~mode2~0 % 256; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {64214#true} assume ~id3~0 >= 0; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {64214#true} assume 0 == ~st3~0; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {64214#true} assume ~send3~0 == ~id3~0; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {64214#true} assume 0 == ~mode3~0 % 256; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {64214#true} assume ~id4~0 >= 0; {64214#true} is VALID [2022-02-20 18:30:44,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {64214#true} assume 0 == ~st4~0; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {64214#true} assume ~send4~0 == ~id4~0; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {64214#true} assume 0 == ~mode4~0 % 256; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {64214#true} assume ~id5~0 >= 0; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {64214#true} assume 0 == ~st5~0; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {64214#true} assume ~send5~0 == ~id5~0; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {64214#true} assume 0 == ~mode5~0 % 256; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {64214#true} assume ~id6~0 >= 0; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {64214#true} assume 0 == ~st6~0; {64214#true} is VALID [2022-02-20 18:30:44,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {64214#true} assume ~send6~0 == ~id6~0; {64214#true} is VALID [2022-02-20 18:30:44,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {64214#true} assume 0 == ~mode6~0 % 256; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,134 INFO L290 TraceCheckUtils]: 43: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {64216#(= (+ (* (- 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;main_~i2~0#1 := 0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {64216#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 67: Hoare triple {64216#(= (+ (* (- 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; {64215#false} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 68: Hoare triple {64215#false} assume node6_~m6~0#1 != ~nomsg~0; {64215#false} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 69: Hoare triple {64215#false} assume !(node6_~m6~0#1 > ~id6~0); {64215#false} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 70: Hoare triple {64215#false} assume node6_~m6~0#1 == ~id6~0;~st6~0 := 1; {64215#false} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {64215#false} ~mode6~0 := 0; {64215#false} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {64215#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64215#false} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 73: Hoare triple {64215#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {64215#false} is VALID [2022-02-20 18:30:44,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {64215#false} check_#res#1 := check_~tmp~1#1; {64215#false} is VALID [2022-02-20 18:30:44,144 INFO L290 TraceCheckUtils]: 75: Hoare triple {64215#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64215#false} is VALID [2022-02-20 18:30:44,144 INFO L290 TraceCheckUtils]: 76: Hoare triple {64215#false} assume 0 == assert_~arg#1 % 256; {64215#false} is VALID [2022-02-20 18:30:44,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {64215#false} assume !false; {64215#false} is VALID [2022-02-20 18:30:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:44,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:44,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242298522] [2022-02-20 18:30:44,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242298522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:44,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:44,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:44,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181908412] [2022-02-20 18:30:44,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:44,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:44,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:44,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:44,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:44,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:44,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:44,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:44,192 INFO L87 Difference]: Start difference. First operand 2218 states and 3345 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:47,590 INFO L93 Difference]: Finished difference Result 6270 states and 9459 transitions. [2022-02-20 18:30:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:47,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:47,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:47,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:47,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:48,316 INFO L225 Difference]: With dead ends: 6270 [2022-02-20 18:30:48,316 INFO L226 Difference]: Without dead ends: 4100 [2022-02-20 18:30:48,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:48,319 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 65 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:48,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2022-02-20 18:30:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4098. [2022-02-20 18:30:50,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:50,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4100 states. Second operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:50,786 INFO L74 IsIncluded]: Start isIncluded. First operand 4100 states. Second operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:50,791 INFO L87 Difference]: Start difference. First operand 4100 states. Second operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:51,229 INFO L93 Difference]: Finished difference Result 4100 states and 6114 transitions. [2022-02-20 18:30:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6114 transitions. [2022-02-20 18:30:51,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:51,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:51,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 0 states have call successors, (0), 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 4100 states. [2022-02-20 18:30:51,258 INFO L87 Difference]: Start difference. First operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 0 states have call successors, (0), 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 4100 states. [2022-02-20 18:30:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:51,686 INFO L93 Difference]: Finished difference Result 4100 states and 6114 transitions. [2022-02-20 18:30:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6114 transitions. [2022-02-20 18:30:51,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:51,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:51,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:51,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 6113 transitions. [2022-02-20 18:30:52,249 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 6113 transitions. Word has length 78 [2022-02-20 18:30:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:52,250 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 6113 transitions. [2022-02-20 18:30:52,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 6113 transitions. [2022-02-20 18:30:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:52,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:52,251 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] [2022-02-20 18:30:52,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:30:52,251 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1594818679, now seen corresponding path program 1 times [2022-02-20 18:30:52,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:52,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869971953] [2022-02-20 18:30:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:52,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {84911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {84911#true} is VALID [2022-02-20 18:30:52,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {84911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {84911#true} is VALID [2022-02-20 18:30:52,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {84911#true} assume 0 == ~r1~0 % 256; {84911#true} is VALID [2022-02-20 18:30:52,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {84911#true} assume ~id1~0 >= 0; {84911#true} is VALID [2022-02-20 18:30:52,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {84911#true} assume 0 == ~st1~0; {84911#true} is VALID [2022-02-20 18:30:52,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {84911#true} assume ~send1~0 == ~id1~0; {84911#true} is VALID [2022-02-20 18:30:52,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {84911#true} assume 0 == ~mode1~0 % 256; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {84911#true} assume ~id2~0 >= 0; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {84911#true} assume 0 == ~st2~0; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {84911#true} assume ~send2~0 == ~id2~0; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {84911#true} assume 0 == ~mode2~0 % 256; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {84911#true} assume ~id3~0 >= 0; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {84911#true} assume 0 == ~st3~0; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {84911#true} assume ~send3~0 == ~id3~0; {84911#true} is VALID [2022-02-20 18:30:52,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {84911#true} assume 0 == ~mode3~0 % 256; {84911#true} is VALID [2022-02-20 18:30:52,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {84911#true} assume ~id4~0 >= 0; {84911#true} is VALID [2022-02-20 18:30:52,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {84911#true} assume 0 == ~st4~0; {84911#true} is VALID [2022-02-20 18:30:52,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {84911#true} assume ~send4~0 == ~id4~0; {84911#true} is VALID [2022-02-20 18:30:52,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {84911#true} assume 0 == ~mode4~0 % 256; {84911#true} is VALID [2022-02-20 18:30:52,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {84911#true} assume ~id5~0 >= 0; {84911#true} is VALID [2022-02-20 18:30:52,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {84911#true} assume 0 == ~st5~0; {84911#true} is VALID [2022-02-20 18:30:52,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {84911#true} assume ~send5~0 == ~id5~0; {84911#true} is VALID [2022-02-20 18:30:52,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {84911#true} assume 0 == ~mode5~0 % 256; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,317 INFO L290 TraceCheckUtils]: 45: Hoare triple {84913#(= (+ (* (- 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;main_~i2~0#1 := 0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,324 INFO L290 TraceCheckUtils]: 61: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,324 INFO L290 TraceCheckUtils]: 62: Hoare triple {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {84913#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:52,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {84913#(= (+ (* (- 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; {84912#false} is VALID [2022-02-20 18:30:52,325 INFO L290 TraceCheckUtils]: 64: Hoare triple {84912#false} assume node5_~m5~0#1 != ~nomsg~0; {84912#false} is VALID [2022-02-20 18:30:52,325 INFO L290 TraceCheckUtils]: 65: Hoare triple {84912#false} assume !(node5_~m5~0#1 > ~id5~0); {84912#false} is VALID [2022-02-20 18:30:52,325 INFO L290 TraceCheckUtils]: 66: Hoare triple {84912#false} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {84912#false} is VALID [2022-02-20 18:30:52,325 INFO L290 TraceCheckUtils]: 67: Hoare triple {84912#false} ~mode5~0 := 0; {84912#false} is VALID [2022-02-20 18:30:52,325 INFO L290 TraceCheckUtils]: 68: Hoare triple {84912#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {84912#false} is VALID [2022-02-20 18:30:52,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {84912#false} assume !(0 != ~mode6~0 % 256); {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 70: Hoare triple {84912#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 71: Hoare triple {84912#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {84912#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {84912#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {84912#false} check_#res#1 := check_~tmp~1#1; {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {84912#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {84912#false} assume 0 == assert_~arg#1 % 256; {84912#false} is VALID [2022-02-20 18:30:52,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {84912#false} assume !false; {84912#false} is VALID [2022-02-20 18:30:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:30:52,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:52,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869971953] [2022-02-20 18:30:52,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869971953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:52,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:52,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:52,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266189464] [2022-02-20 18:30:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:52,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:30:52,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:52,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:30:52,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:52,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:52,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:52,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:52,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:52,384 INFO L87 Difference]: Start difference. First operand 4098 states and 6113 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:01,367 INFO L93 Difference]: Finished difference Result 11622 states and 17283 transitions. [2022-02-20 18:31:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:01,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-02-20 18:31:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:31:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:31:01,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:31:01,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:03,462 INFO L225 Difference]: With dead ends: 11622 [2022-02-20 18:31:03,463 INFO L226 Difference]: Without dead ends: 7572 [2022-02-20 18:31:03,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:03,466 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 69 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:03,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 311 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7572 states. [2022-02-20 18:31:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7572 to 7570. [2022-02-20 18:31:07,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:07,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7572 states. Second operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:07,528 INFO L74 IsIncluded]: Start isIncluded. First operand 7572 states. Second operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:07,532 INFO L87 Difference]: Start difference. First operand 7572 states. Second operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:09,043 INFO L93 Difference]: Finished difference Result 7572 states and 11122 transitions. [2022-02-20 18:31:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 11122 transitions. [2022-02-20 18:31:09,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:09,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:09,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 0 states have call successors, (0), 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 7572 states. [2022-02-20 18:31:09,061 INFO L87 Difference]: Start difference. First operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 0 states have call successors, (0), 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 7572 states. [2022-02-20 18:31:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:10,595 INFO L93 Difference]: Finished difference Result 7572 states and 11122 transitions. [2022-02-20 18:31:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 11122 transitions. [2022-02-20 18:31:10,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:10,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:10,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:10,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 11121 transitions. [2022-02-20 18:31:12,415 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 11121 transitions. Word has length 78 [2022-02-20 18:31:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:12,415 INFO L470 AbstractCegarLoop]: Abstraction has 7570 states and 11121 transitions. [2022-02-20 18:31:12,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 11121 transitions. [2022-02-20 18:31:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:31:12,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:12,416 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] [2022-02-20 18:31:12,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:31:12,416 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2140223893, now seen corresponding path program 1 times [2022-02-20 18:31:12,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:12,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956974431] [2022-02-20 18:31:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:12,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {123496#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {123498#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:31:12,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {123498#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {123498#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:31:12,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {123498#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {123498#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:31:12,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {123498#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {123499#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:31:12,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {123499#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {123499#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:31:12,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {123499#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id6~0 >= 0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st6~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send6~0 == ~id6~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode6~0 % 256; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id6~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id6~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id6~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id6~0; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} init_#res#1 := init_~tmp~0#1; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == assume_abort_if_not_~cond#1); {123500#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:12,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {123500#(<= (+ ~nomsg~0 1) ~send1~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;main_~i2~0#1 := 0; {123501#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:31:12,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {123501#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {123501#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:31:12,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {123501#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !(0 != ~mode1~0 % 256); {123501#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:31:12,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {123501#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {123497#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {123497#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {123497#false} assume !(0 != ~mode2~0 % 256); {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {123497#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {123497#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {123497#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 55: Hoare triple {123497#false} assume !(0 != ~mode3~0 % 256); {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 56: Hoare triple {123497#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {123497#false} is VALID [2022-02-20 18:31:12,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {123497#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 58: Hoare triple {123497#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {123497#false} assume !(0 != ~mode4~0 % 256); {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {123497#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {123497#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {123497#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {123497#false} assume !(0 != ~mode5~0 % 256); {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 64: Hoare triple {123497#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {123497#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 66: Hoare triple {123497#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {123497#false} is VALID [2022-02-20 18:31:12,511 INFO L290 TraceCheckUtils]: 67: Hoare triple {123497#false} assume !(0 != ~mode6~0 % 256); {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 68: Hoare triple {123497#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 69: Hoare triple {123497#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 70: Hoare triple {123497#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 71: Hoare triple {123497#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {123497#false} assume !(~r1~0 % 256 >= 6); {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 73: Hoare triple {123497#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {123497#false} assume ~r1~0 % 256 < 6;check_~tmp~1#1 := 1; {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 75: Hoare triple {123497#false} check_#res#1 := check_~tmp~1#1; {123497#false} is VALID [2022-02-20 18:31:12,512 INFO L290 TraceCheckUtils]: 76: Hoare triple {123497#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {123497#false} is VALID [2022-02-20 18:31:12,513 INFO L290 TraceCheckUtils]: 77: Hoare triple {123497#false} assume 0 == assert_~arg#1 % 256; {123497#false} is VALID [2022-02-20 18:31:12,513 INFO L290 TraceCheckUtils]: 78: Hoare triple {123497#false} assume !false; {123497#false} is VALID [2022-02-20 18:31:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:31:12,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:12,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956974431] [2022-02-20 18:31:12,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956974431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:12,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:12,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:12,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551844660] [2022-02-20 18:31:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-20 18:31:12,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:12,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:12,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:12,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:31:12,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:31:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:31:12,559 INFO L87 Difference]: Start difference. First operand 7570 states and 11121 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)