./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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 892c0a4dacb59a58720267a26ccd1ecf3e12464bea70926a81b5c091372cff3e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:53:53,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:53:53,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:53:53,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:53:53,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:53:53,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:53:53,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:53:53,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:53:53,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:53:53,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:53:53,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:53:53,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:53:53,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:53:53,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:53:53,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:53:53,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:53:53,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:53:53,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:53:53,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:53:53,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:53:53,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:53:53,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:53:53,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:53:53,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:53:53,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:53:53,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:53:53,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:53:53,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:53:53,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:53:53,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:53:53,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:53:53,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:53:53,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:53:53,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:53:53,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:53:53,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:53:53,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:53:53,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:53:53,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:53:53,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:53:53,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:53:53,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:53:53,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:53:53,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:53:53,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:53:53,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:53:53,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:53:53,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:53:53,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:53:53,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:53:53,420 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:53:53,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:53:53,421 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:53:53,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:53:53,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:53:53,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:53:53,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:53:53,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:53:53,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:53:53,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:53:53,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:53:53,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:53:53,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:53:53,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:53:53,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:53:53,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:53:53,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:53,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:53:53,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:53:53,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:53:53,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:53:53,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:53:53,425 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:53:53,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:53:53,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:53:53,426 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 -> 892c0a4dacb59a58720267a26ccd1ecf3e12464bea70926a81b5c091372cff3e [2022-02-20 19:53:53,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:53:53,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:53:53,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:53:53,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:53:53,682 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:53:53,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:53:53,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba49f97d/25926bdbe725489bb7706028e51d7124/FLAGe4e40abd1 [2022-02-20 19:53:54,425 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:53:54,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:53:54,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba49f97d/25926bdbe725489bb7706028e51d7124/FLAGe4e40abd1 [2022-02-20 19:53:54,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dba49f97d/25926bdbe725489bb7706028e51d7124 [2022-02-20 19:53:54,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:53:54,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:53:54,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:54,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:53:54,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:53:54,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:54" (1/1) ... [2022-02-20 19:53:54,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da2b52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:54, skipping insertion in model container [2022-02-20 19:53:54,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:54" (1/1) ... [2022-02-20 19:53:54,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:53:54,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:53:55,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[26962,26975] [2022-02-20 19:53:55,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[34252,34265] [2022-02-20 19:53:55,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:56,001 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:53:56,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[26962,26975] [2022-02-20 19:53:56,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[34252,34265] [2022-02-20 19:53:56,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:56,455 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:53:56,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56 WrapperNode [2022-02-20 19:53:56,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:56,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:56,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:53:56,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:53:56,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:56,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:56,990 INFO L137 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5277 [2022-02-20 19:53:56,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:56,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:53:56,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:53:56,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:53:56,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:53:57,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:53:57,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:53:57,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:53:57,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (1/1) ... [2022-02-20 19:53:57,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:57,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:57,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:53:57,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:53:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:53:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:53:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:53:57,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:53:57,760 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:53:57,761 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:54:05,995 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:54:06,017 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:54:06,018 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:54:06,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:06 BoogieIcfgContainer [2022-02-20 19:54:06,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:54:06,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:54:06,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:54:06,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:54:06,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:53:54" (1/3) ... [2022-02-20 19:54:06,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e030b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:06, skipping insertion in model container [2022-02-20 19:54:06,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:56" (2/3) ... [2022-02-20 19:54:06,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e030b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:06, skipping insertion in model container [2022-02-20 19:54:06,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:06" (3/3) ... [2022-02-20 19:54:06,029 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:54:06,033 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:54:06,033 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:54:06,086 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:54:06,100 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:54:06,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:54:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:54:06,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:06,168 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] [2022-02-20 19:54:06,168 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2107180874, now seen corresponding path program 1 times [2022-02-20 19:54:06,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:06,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266251371] [2022-02-20 19:54:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:06,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {966#true} is VALID [2022-02-20 19:54:06,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {966#true} is VALID [2022-02-20 19:54:06,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {966#true} is VALID [2022-02-20 19:54:06,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {966#true} is VALID [2022-02-20 19:54:06,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#true} init_#res#1 := init_~tmp~0#1; {966#true} is VALID [2022-02-20 19:54:06,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {966#true} is VALID [2022-02-20 19:54:06,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {966#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {967#false} is VALID [2022-02-20 19:54:06,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {967#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {967#false} is VALID [2022-02-20 19:54:06,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {967#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {967#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {967#false} assume !(node1_~m1~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:54:06,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {967#false} ~mode1~0 := 0; {967#false} is VALID [2022-02-20 19:54:06,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {967#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !(node2_~m2~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:54:06,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} ~mode2~0 := 0; {967#false} is VALID [2022-02-20 19:54:06,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !(node3_~m3~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:54:06,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} ~mode3~0 := 0; {967#false} is VALID [2022-02-20 19:54:06,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} assume !(0 != ~mode4~0 % 256); {967#false} is VALID [2022-02-20 19:54:06,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {967#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {967#false} is VALID [2022-02-20 19:54:06,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {967#false} is VALID [2022-02-20 19:54:06,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !(0 != ~mode5~0 % 256); {967#false} is VALID [2022-02-20 19:54:06,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {967#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {967#false} is VALID [2022-02-20 19:54:06,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {967#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {967#false} is VALID [2022-02-20 19:54:06,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {967#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {967#false} assume !(0 != ~mode6~0 % 256); {967#false} is VALID [2022-02-20 19:54:06,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {967#false} is VALID [2022-02-20 19:54:06,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {967#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {967#false} is VALID [2022-02-20 19:54:06,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {967#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {967#false} assume !(0 != ~mode7~0 % 256); {967#false} is VALID [2022-02-20 19:54:06,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {967#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {967#false} is VALID [2022-02-20 19:54:06,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {967#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {967#false} is VALID [2022-02-20 19:54:06,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {967#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {967#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {967#false} is VALID [2022-02-20 19:54:06,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {967#false} assume !(node8_~m8~0#1 != ~nomsg~0); {967#false} is VALID [2022-02-20 19:54:06,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {967#false} ~mode8~0 := 0; {967#false} is VALID [2022-02-20 19:54:06,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {967#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {967#false} is VALID [2022-02-20 19:54:06,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {967#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {967#false} is VALID [2022-02-20 19:54:06,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {967#false} check_#res#1 := check_~tmp~1#1; {967#false} is VALID [2022-02-20 19:54:06,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {967#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {967#false} is VALID [2022-02-20 19:54:06,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {967#false} assume 0 == assert_~arg#1 % 256; {967#false} is VALID [2022-02-20 19:54:06,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 19:54:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:06,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:06,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266251371] [2022-02-20 19:54:06,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266251371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:06,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:06,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:54:06,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104767935] [2022-02-20 19:54:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:54:06,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:06,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:06,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:06,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:54:06,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:54:06,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:54:06,634 INFO L87 Difference]: Start difference. First operand has 963 states, 960 states have (on average 1.896875) internal successors, (1821), 962 states have internal predecessors, (1821), 0 states have call successors, (0), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:08,138 INFO L93 Difference]: Finished difference Result 1857 states and 3510 transitions. [2022-02-20 19:54:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:54:08,139 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:54:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3510 transitions. [2022-02-20 19:54:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3510 transitions. [2022-02-20 19:54:08,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3510 transitions. [2022-02-20 19:54:10,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3510 edges. 3510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:11,121 INFO L225 Difference]: With dead ends: 1857 [2022-02-20 19:54:11,122 INFO L226 Difference]: Without dead ends: 897 [2022-02-20 19:54:11,130 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 19:54:11,135 INFO L933 BasicCegarLoop]: 1752 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, 1752 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 19:54:11,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-02-20 19:54:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2022-02-20 19:54:11,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:11,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:11,238 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:11,240 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:11,288 INFO L93 Difference]: Finished difference Result 897 states and 1688 transitions. [2022-02-20 19:54:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1688 transitions. [2022-02-20 19:54:11,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:11,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:11,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:54:11,307 INFO L87 Difference]: Start difference. First operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:54:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:11,353 INFO L93 Difference]: Finished difference Result 897 states and 1688 transitions. [2022-02-20 19:54:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1688 transitions. [2022-02-20 19:54:11,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:11,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:11,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:11,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 895 states have (on average 1.8860335195530726) internal successors, (1688), 896 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1688 transitions. [2022-02-20 19:54:11,407 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1688 transitions. Word has length 46 [2022-02-20 19:54:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:11,407 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 1688 transitions. [2022-02-20 19:54:11,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1688 transitions. [2022-02-20 19:54:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:54:11,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:11,409 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] [2022-02-20 19:54:11,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:54:11,410 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash 815979124, now seen corresponding path program 1 times [2022-02-20 19:54:11,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:11,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123729263] [2022-02-20 19:54:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:11,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {5571#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5571#true} is VALID [2022-02-20 19:54:11,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {5571#true} is VALID [2022-02-20 19:54:11,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5571#true} is VALID [2022-02-20 19:54:11,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {5571#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5573#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:54:11,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {5573#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5574#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:54:11,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {5574#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5575#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:54:11,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {5575#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5572#false} is VALID [2022-02-20 19:54:11,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {5572#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5572#false} is VALID [2022-02-20 19:54:11,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {5572#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {5572#false} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {5572#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5572#false} is VALID [2022-02-20 19:54:11,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {5572#false} ~mode1~0 := 0; {5572#false} is VALID [2022-02-20 19:54:11,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {5572#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {5572#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {5572#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5572#false} is VALID [2022-02-20 19:54:11,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {5572#false} ~mode2~0 := 0; {5572#false} is VALID [2022-02-20 19:54:11,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {5572#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {5572#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {5572#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5572#false} is VALID [2022-02-20 19:54:11,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {5572#false} ~mode3~0 := 0; {5572#false} is VALID [2022-02-20 19:54:11,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {5572#false} assume !(0 != ~mode4~0 % 256); {5572#false} is VALID [2022-02-20 19:54:11,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {5572#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {5572#false} is VALID [2022-02-20 19:54:11,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {5572#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {5572#false} is VALID [2022-02-20 19:54:11,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {5572#false} assume !(0 != ~mode5~0 % 256); {5572#false} is VALID [2022-02-20 19:54:11,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {5572#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {5572#false} is VALID [2022-02-20 19:54:11,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {5572#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {5572#false} is VALID [2022-02-20 19:54:11,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {5572#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {5572#false} assume !(0 != ~mode6~0 % 256); {5572#false} is VALID [2022-02-20 19:54:11,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {5572#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {5572#false} is VALID [2022-02-20 19:54:11,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {5572#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {5572#false} is VALID [2022-02-20 19:54:11,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {5572#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {5572#false} assume !(0 != ~mode7~0 % 256); {5572#false} is VALID [2022-02-20 19:54:11,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {5572#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {5572#false} is VALID [2022-02-20 19:54:11,561 INFO L290 TraceCheckUtils]: 35: Hoare triple {5572#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {5572#false} is VALID [2022-02-20 19:54:11,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {5572#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {5572#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5572#false} is VALID [2022-02-20 19:54:11,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {5572#false} assume !(node8_~m8~0#1 != ~nomsg~0); {5572#false} is VALID [2022-02-20 19:54:11,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {5572#false} ~mode8~0 := 0; {5572#false} is VALID [2022-02-20 19:54:11,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {5572#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5572#false} is VALID [2022-02-20 19:54:11,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {5572#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {5572#false} is VALID [2022-02-20 19:54:11,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {5572#false} check_#res#1 := check_~tmp~1#1; {5572#false} is VALID [2022-02-20 19:54:11,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {5572#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5572#false} is VALID [2022-02-20 19:54:11,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#false} assume 0 == assert_~arg#1 % 256; {5572#false} is VALID [2022-02-20 19:54:11,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-02-20 19:54:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:11,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:11,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123729263] [2022-02-20 19:54:11,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123729263] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:11,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:11,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:54:11,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551334347] [2022-02-20 19:54:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:54:11,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:11,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:11,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:11,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:54:11,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:11,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:54:11,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:11,597 INFO L87 Difference]: Start difference. First operand 897 states and 1688 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:16,166 INFO L93 Difference]: Finished difference Result 977 states and 1813 transitions. [2022-02-20 19:54:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:54:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:54:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2022-02-20 19:54:16,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1813 transitions. [2022-02-20 19:54:17,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1813 edges. 1813 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:17,680 INFO L225 Difference]: With dead ends: 977 [2022-02-20 19:54:17,680 INFO L226 Difference]: Without dead ends: 897 [2022-02-20 19:54:17,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:17,682 INFO L933 BasicCegarLoop]: 1686 mSDtfsCounter, 3 mSDsluCounter, 4994 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6680 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:17,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6680 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-02-20 19:54:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2022-02-20 19:54:17,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:17,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,704 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,705 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:17,748 INFO L93 Difference]: Finished difference Result 897 states and 1627 transitions. [2022-02-20 19:54:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1627 transitions. [2022-02-20 19:54:17,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:17,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:17,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:54:17,754 INFO L87 Difference]: Start difference. First operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 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 897 states. [2022-02-20 19:54:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:17,796 INFO L93 Difference]: Finished difference Result 897 states and 1627 transitions. [2022-02-20 19:54:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1627 transitions. [2022-02-20 19:54:17,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:17,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:17,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:17,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 895 states have (on average 1.817877094972067) internal successors, (1627), 896 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1627 transitions. [2022-02-20 19:54:17,844 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1627 transitions. Word has length 46 [2022-02-20 19:54:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:17,844 INFO L470 AbstractCegarLoop]: Abstraction has 897 states and 1627 transitions. [2022-02-20 19:54:17,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1627 transitions. [2022-02-20 19:54:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 19:54:17,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:17,848 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] [2022-02-20 19:54:17,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:54:17,848 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash -967931068, now seen corresponding path program 1 times [2022-02-20 19:54:17,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:17,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140696992] [2022-02-20 19:54:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:18,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {9296#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,069 INFO L290 TraceCheckUtils]: 47: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9298#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:54:18,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {9298#(<= (+ ~a17~0 124) 0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9297#false} is VALID [2022-02-20 19:54:18,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {9297#false} assume !false; {9297#false} is VALID [2022-02-20 19:54:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:18,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:18,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140696992] [2022-02-20 19:54:18,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140696992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:18,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:18,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:54:18,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914286206] [2022-02-20 19:54:18,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:18,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 19:54:18,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:18,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:18,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:18,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:18,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:18,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:18,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:18,130 INFO L87 Difference]: Start difference. First operand 897 states and 1627 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:23,897 INFO L93 Difference]: Finished difference Result 2401 states and 4500 transitions. [2022-02-20 19:54:23,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:23,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 19:54:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:54:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4500 transitions. [2022-02-20 19:54:23,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4500 transitions. [2022-02-20 19:54:27,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4500 edges. 4500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:27,711 INFO L225 Difference]: With dead ends: 2401 [2022-02-20 19:54:27,711 INFO L226 Difference]: Without dead ends: 1648 [2022-02-20 19:54:27,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:27,714 INFO L933 BasicCegarLoop]: 656 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:27,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [926 Valid, 663 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:54:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-20 19:54:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2022-02-20 19:54:27,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:27,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:27,761 INFO L74 IsIncluded]: Start isIncluded. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:27,765 INFO L87 Difference]: Start difference. First operand 1648 states. Second operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:27,936 INFO L93 Difference]: Finished difference Result 1648 states and 2606 transitions. [2022-02-20 19:54:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2606 transitions. [2022-02-20 19:54:27,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:27,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:27,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:54:27,948 INFO L87 Difference]: Start difference. First operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 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 1648 states. [2022-02-20 19:54:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:28,076 INFO L93 Difference]: Finished difference Result 1648 states and 2606 transitions. [2022-02-20 19:54:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2606 transitions. [2022-02-20 19:54:28,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:28,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:28,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:28,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1646 states have (on average 1.583232077764277) internal successors, (2606), 1647 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2606 transitions. [2022-02-20 19:54:28,207 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2606 transitions. Word has length 63 [2022-02-20 19:54:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:28,207 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2606 transitions. [2022-02-20 19:54:28,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2606 transitions. [2022-02-20 19:54:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:28,209 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:28,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:28,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:28,210 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1090783836, now seen corresponding path program 1 times [2022-02-20 19:54:28,211 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:28,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759513376] [2022-02-20 19:54:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:28,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {16695#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {16695#true} is VALID [2022-02-20 19:54:28,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {16695#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {16695#true} is VALID [2022-02-20 19:54:28,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {16695#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16695#true} is VALID [2022-02-20 19:54:28,363 INFO L290 TraceCheckUtils]: 3: Hoare triple {16695#true} assume 0 == ~r1~0 % 256; {16695#true} is VALID [2022-02-20 19:54:28,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {16695#true} assume ~id1~0 >= 0; {16695#true} is VALID [2022-02-20 19:54:28,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {16695#true} assume 0 == ~st1~0; {16695#true} is VALID [2022-02-20 19:54:28,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {16695#true} assume ~send1~0 == ~id1~0; {16695#true} is VALID [2022-02-20 19:54:28,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {16695#true} assume 0 == ~mode1~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 >= 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send7~0 == ~id7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode7~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id8~0 >= 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send8~0 == ~id8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode8~0 % 256; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,381 INFO L290 TraceCheckUtils]: 43: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id7~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 != ~id8~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,398 INFO L290 TraceCheckUtils]: 67: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,398 INFO L290 TraceCheckUtils]: 68: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:54:28,399 INFO L290 TraceCheckUtils]: 69: Hoare triple {16697#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p8_old~0;~p8_old~0 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,399 INFO L290 TraceCheckUtils]: 70: Hoare triple {16696#false} assume !(node1_~m1~0#1 != ~nomsg~0); {16696#false} is VALID [2022-02-20 19:54:28,399 INFO L290 TraceCheckUtils]: 71: Hoare triple {16696#false} ~mode1~0 := 0; {16696#false} is VALID [2022-02-20 19:54:28,399 INFO L290 TraceCheckUtils]: 72: Hoare triple {16696#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {16696#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {16696#false} assume !(node2_~m2~0#1 != ~nomsg~0); {16696#false} is VALID [2022-02-20 19:54:28,400 INFO L290 TraceCheckUtils]: 75: Hoare triple {16696#false} ~mode2~0 := 0; {16696#false} is VALID [2022-02-20 19:54:28,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {16696#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {16696#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,401 INFO L290 TraceCheckUtils]: 78: Hoare triple {16696#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16696#false} is VALID [2022-02-20 19:54:28,401 INFO L290 TraceCheckUtils]: 79: Hoare triple {16696#false} ~mode3~0 := 0; {16696#false} is VALID [2022-02-20 19:54:28,401 INFO L290 TraceCheckUtils]: 80: Hoare triple {16696#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {16696#false} assume !(0 != ~mode4~0 % 256); {16696#false} is VALID [2022-02-20 19:54:28,406 INFO L290 TraceCheckUtils]: 82: Hoare triple {16696#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {16696#false} is VALID [2022-02-20 19:54:28,407 INFO L290 TraceCheckUtils]: 83: Hoare triple {16696#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {16696#false} is VALID [2022-02-20 19:54:28,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {16696#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {16696#false} assume !(0 != ~mode5~0 % 256); {16696#false} is VALID [2022-02-20 19:54:28,413 INFO L290 TraceCheckUtils]: 86: Hoare triple {16696#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {16696#false} is VALID [2022-02-20 19:54:28,413 INFO L290 TraceCheckUtils]: 87: Hoare triple {16696#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {16696#false} is VALID [2022-02-20 19:54:28,413 INFO L290 TraceCheckUtils]: 88: Hoare triple {16696#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,413 INFO L290 TraceCheckUtils]: 89: Hoare triple {16696#false} assume !(0 != ~mode6~0 % 256); {16696#false} is VALID [2022-02-20 19:54:28,414 INFO L290 TraceCheckUtils]: 90: Hoare triple {16696#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {16696#false} is VALID [2022-02-20 19:54:28,414 INFO L290 TraceCheckUtils]: 91: Hoare triple {16696#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {16696#false} is VALID [2022-02-20 19:54:28,415 INFO L290 TraceCheckUtils]: 92: Hoare triple {16696#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,415 INFO L290 TraceCheckUtils]: 93: Hoare triple {16696#false} assume !(0 != ~mode7~0 % 256); {16696#false} is VALID [2022-02-20 19:54:28,415 INFO L290 TraceCheckUtils]: 94: Hoare triple {16696#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {16696#false} is VALID [2022-02-20 19:54:28,415 INFO L290 TraceCheckUtils]: 95: Hoare triple {16696#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {16696#false} is VALID [2022-02-20 19:54:28,415 INFO L290 TraceCheckUtils]: 96: Hoare triple {16696#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,416 INFO L290 TraceCheckUtils]: 97: Hoare triple {16696#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {16696#false} is VALID [2022-02-20 19:54:28,416 INFO L290 TraceCheckUtils]: 98: Hoare triple {16696#false} assume !(node8_~m8~0#1 != ~nomsg~0); {16696#false} is VALID [2022-02-20 19:54:28,416 INFO L290 TraceCheckUtils]: 99: Hoare triple {16696#false} ~mode8~0 := 0; {16696#false} is VALID [2022-02-20 19:54:28,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {16696#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16696#false} is VALID [2022-02-20 19:54:28,419 INFO L290 TraceCheckUtils]: 101: Hoare triple {16696#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {16696#false} is VALID [2022-02-20 19:54:28,420 INFO L290 TraceCheckUtils]: 102: Hoare triple {16696#false} check_#res#1 := check_~tmp~1#1; {16696#false} is VALID [2022-02-20 19:54:28,420 INFO L290 TraceCheckUtils]: 103: Hoare triple {16696#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {16696#false} is VALID [2022-02-20 19:54:28,420 INFO L290 TraceCheckUtils]: 104: Hoare triple {16696#false} assume 0 == assert_~arg#1 % 256; {16696#false} is VALID [2022-02-20 19:54:28,420 INFO L290 TraceCheckUtils]: 105: Hoare triple {16696#false} assume !false; {16696#false} is VALID [2022-02-20 19:54:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:28,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:28,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759513376] [2022-02-20 19:54:28,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759513376] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:28,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:28,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:28,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107156129] [2022-02-20 19:54:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:28,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:28,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:28,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:28,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:28,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:28,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:28,508 INFO L87 Difference]: Start difference. First operand 1648 states and 2606 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:30,420 INFO L93 Difference]: Finished difference Result 1794 states and 2838 transitions. [2022-02-20 19:54:30,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:30,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:54:31,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:32,053 INFO L225 Difference]: With dead ends: 1794 [2022-02-20 19:54:32,053 INFO L226 Difference]: Without dead ends: 1718 [2022-02-20 19:54:32,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:32,055 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1550 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:32,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1550 Valid, 1853 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2022-02-20 19:54:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1716. [2022-02-20 19:54:32,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:32,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1718 states. Second operand has 1716 states, 1714 states have (on average 1.5840140023337224) internal successors, (2715), 1715 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,113 INFO L74 IsIncluded]: Start isIncluded. First operand 1718 states. Second operand has 1716 states, 1714 states have (on average 1.5840140023337224) internal successors, (2715), 1715 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,116 INFO L87 Difference]: Start difference. First operand 1718 states. Second operand has 1716 states, 1714 states have (on average 1.5840140023337224) internal successors, (2715), 1715 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:32,216 INFO L93 Difference]: Finished difference Result 1718 states and 2716 transitions. [2022-02-20 19:54:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2716 transitions. [2022-02-20 19:54:32,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:32,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:32,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 1716 states, 1714 states have (on average 1.5840140023337224) internal successors, (2715), 1715 states have internal predecessors, (2715), 0 states have call successors, (0), 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 1718 states. [2022-02-20 19:54:32,223 INFO L87 Difference]: Start difference. First operand has 1716 states, 1714 states have (on average 1.5840140023337224) internal successors, (2715), 1715 states have internal predecessors, (2715), 0 states have call successors, (0), 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 1718 states. [2022-02-20 19:54:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:32,322 INFO L93 Difference]: Finished difference Result 1718 states and 2716 transitions. [2022-02-20 19:54:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2716 transitions. [2022-02-20 19:54:32,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:32,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:32,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:32,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1714 states have (on average 1.5840140023337224) internal successors, (2715), 1715 states have internal predecessors, (2715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2715 transitions. [2022-02-20 19:54:32,450 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2715 transitions. Word has length 106 [2022-02-20 19:54:32,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:32,451 INFO L470 AbstractCegarLoop]: Abstraction has 1716 states and 2715 transitions. [2022-02-20 19:54:32,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2715 transitions. [2022-02-20 19:54:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:32,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:32,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:32,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:54:32,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash 326222874, now seen corresponding path program 1 times [2022-02-20 19:54:32,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:32,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873867356] [2022-02-20 19:54:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:32,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:32,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {23723#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {23723#true} is VALID [2022-02-20 19:54:32,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {23723#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {23723#true} is VALID [2022-02-20 19:54:32,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {23723#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {23723#true} is VALID [2022-02-20 19:54:32,550 INFO L290 TraceCheckUtils]: 3: Hoare triple {23723#true} assume 0 == ~r1~0 % 256; {23723#true} is VALID [2022-02-20 19:54:32,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {23723#true} assume ~id1~0 >= 0; {23723#true} is VALID [2022-02-20 19:54:32,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {23723#true} assume 0 == ~st1~0; {23723#true} is VALID [2022-02-20 19:54:32,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {23723#true} assume ~send1~0 == ~id1~0; {23723#true} is VALID [2022-02-20 19:54:32,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {23723#true} assume 0 == ~mode1~0 % 256; {23723#true} is VALID [2022-02-20 19:54:32,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {23723#true} assume ~id2~0 >= 0; {23723#true} is VALID [2022-02-20 19:54:32,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {23723#true} assume 0 == ~st2~0; {23723#true} is VALID [2022-02-20 19:54:32,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {23723#true} assume ~send2~0 == ~id2~0; {23723#true} is VALID [2022-02-20 19:54:32,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {23723#true} assume 0 == ~mode2~0 % 256; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,568 INFO L290 TraceCheckUtils]: 43: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,574 INFO L290 TraceCheckUtils]: 55: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,574 INFO L290 TraceCheckUtils]: 56: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,575 INFO L290 TraceCheckUtils]: 57: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,575 INFO L290 TraceCheckUtils]: 58: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,576 INFO L290 TraceCheckUtils]: 59: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,576 INFO L290 TraceCheckUtils]: 60: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,578 INFO L290 TraceCheckUtils]: 63: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,578 INFO L290 TraceCheckUtils]: 64: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,580 INFO L290 TraceCheckUtils]: 67: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,580 INFO L290 TraceCheckUtils]: 68: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,582 INFO L290 TraceCheckUtils]: 71: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {23725#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:54:32,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {23725#(= (+ (* (- 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; {23724#false} is VALID [2022-02-20 19:54:32,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {23724#false} assume !(node2_~m2~0#1 != ~nomsg~0); {23724#false} is VALID [2022-02-20 19:54:32,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {23724#false} ~mode2~0 := 0; {23724#false} is VALID [2022-02-20 19:54:32,584 INFO L290 TraceCheckUtils]: 76: Hoare triple {23724#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {23724#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {23724#false} assume !(node3_~m3~0#1 != ~nomsg~0); {23724#false} is VALID [2022-02-20 19:54:32,584 INFO L290 TraceCheckUtils]: 79: Hoare triple {23724#false} ~mode3~0 := 0; {23724#false} is VALID [2022-02-20 19:54:32,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {23724#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {23724#false} assume !(0 != ~mode4~0 % 256); {23724#false} is VALID [2022-02-20 19:54:32,585 INFO L290 TraceCheckUtils]: 82: Hoare triple {23724#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {23724#false} is VALID [2022-02-20 19:54:32,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {23724#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {23724#false} is VALID [2022-02-20 19:54:32,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {23724#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {23724#false} assume !(0 != ~mode5~0 % 256); {23724#false} is VALID [2022-02-20 19:54:32,585 INFO L290 TraceCheckUtils]: 86: Hoare triple {23724#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {23724#false} is VALID [2022-02-20 19:54:32,586 INFO L290 TraceCheckUtils]: 87: Hoare triple {23724#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {23724#false} is VALID [2022-02-20 19:54:32,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {23724#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {23724#false} assume !(0 != ~mode6~0 % 256); {23724#false} is VALID [2022-02-20 19:54:32,586 INFO L290 TraceCheckUtils]: 90: Hoare triple {23724#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {23724#false} is VALID [2022-02-20 19:54:32,586 INFO L290 TraceCheckUtils]: 91: Hoare triple {23724#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {23724#false} is VALID [2022-02-20 19:54:32,586 INFO L290 TraceCheckUtils]: 92: Hoare triple {23724#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {23724#false} assume !(0 != ~mode7~0 % 256); {23724#false} is VALID [2022-02-20 19:54:32,587 INFO L290 TraceCheckUtils]: 94: Hoare triple {23724#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {23724#false} is VALID [2022-02-20 19:54:32,587 INFO L290 TraceCheckUtils]: 95: Hoare triple {23724#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {23724#false} is VALID [2022-02-20 19:54:32,587 INFO L290 TraceCheckUtils]: 96: Hoare triple {23724#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {23724#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {23724#false} is VALID [2022-02-20 19:54:32,588 INFO L290 TraceCheckUtils]: 98: Hoare triple {23724#false} assume !(node8_~m8~0#1 != ~nomsg~0); {23724#false} is VALID [2022-02-20 19:54:32,588 INFO L290 TraceCheckUtils]: 99: Hoare triple {23724#false} ~mode8~0 := 0; {23724#false} is VALID [2022-02-20 19:54:32,588 INFO L290 TraceCheckUtils]: 100: Hoare triple {23724#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23724#false} is VALID [2022-02-20 19:54:32,588 INFO L290 TraceCheckUtils]: 101: Hoare triple {23724#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {23724#false} is VALID [2022-02-20 19:54:32,588 INFO L290 TraceCheckUtils]: 102: Hoare triple {23724#false} check_#res#1 := check_~tmp~1#1; {23724#false} is VALID [2022-02-20 19:54:32,589 INFO L290 TraceCheckUtils]: 103: Hoare triple {23724#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {23724#false} is VALID [2022-02-20 19:54:32,589 INFO L290 TraceCheckUtils]: 104: Hoare triple {23724#false} assume 0 == assert_~arg#1 % 256; {23724#false} is VALID [2022-02-20 19:54:32,589 INFO L290 TraceCheckUtils]: 105: Hoare triple {23724#false} assume !false; {23724#false} is VALID [2022-02-20 19:54:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:32,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:32,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873867356] [2022-02-20 19:54:32,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873867356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:32,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:32,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:32,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130188849] [2022-02-20 19:54:32,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:32,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:32,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:32,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:32,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:32,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:32,669 INFO L87 Difference]: Start difference. First operand 1716 states and 2715 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:34,592 INFO L93 Difference]: Finished difference Result 1992 states and 3155 transitions. [2022-02-20 19:54:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:34,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:34,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:54:36,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:36,238 INFO L225 Difference]: With dead ends: 1992 [2022-02-20 19:54:36,238 INFO L226 Difference]: Without dead ends: 1848 [2022-02-20 19:54:36,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:36,240 INFO L933 BasicCegarLoop]: 1729 mSDtfsCounter, 1546 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:36,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1546 Valid, 1852 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-02-20 19:54:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1846. [2022-02-20 19:54:36,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:36,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1848 states. Second operand has 1846 states, 1844 states have (on average 1.5845986984815619) internal successors, (2922), 1845 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:36,303 INFO L74 IsIncluded]: Start isIncluded. First operand 1848 states. Second operand has 1846 states, 1844 states have (on average 1.5845986984815619) internal successors, (2922), 1845 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:36,305 INFO L87 Difference]: Start difference. First operand 1848 states. Second operand has 1846 states, 1844 states have (on average 1.5845986984815619) internal successors, (2922), 1845 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:36,455 INFO L93 Difference]: Finished difference Result 1848 states and 2923 transitions. [2022-02-20 19:54:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2923 transitions. [2022-02-20 19:54:36,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:36,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:36,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 1846 states, 1844 states have (on average 1.5845986984815619) internal successors, (2922), 1845 states have internal predecessors, (2922), 0 states have call successors, (0), 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 1848 states. [2022-02-20 19:54:36,464 INFO L87 Difference]: Start difference. First operand has 1846 states, 1844 states have (on average 1.5845986984815619) internal successors, (2922), 1845 states have internal predecessors, (2922), 0 states have call successors, (0), 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 1848 states. [2022-02-20 19:54:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:36,611 INFO L93 Difference]: Finished difference Result 1848 states and 2923 transitions. [2022-02-20 19:54:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2923 transitions. [2022-02-20 19:54:36,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:36,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:36,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:36,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1844 states have (on average 1.5845986984815619) internal successors, (2922), 1845 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2922 transitions. [2022-02-20 19:54:36,745 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2922 transitions. Word has length 106 [2022-02-20 19:54:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:36,745 INFO L470 AbstractCegarLoop]: Abstraction has 1846 states and 2922 transitions. [2022-02-20 19:54:36,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2922 transitions. [2022-02-20 19:54:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:36,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:36,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:36,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:54:36,747 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1573731728, now seen corresponding path program 1 times [2022-02-20 19:54:36,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:36,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306513722] [2022-02-20 19:54:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:36,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {31394#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {31394#true} is VALID [2022-02-20 19:54:36,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {31394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {31394#true} is VALID [2022-02-20 19:54:36,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {31394#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {31394#true} is VALID [2022-02-20 19:54:36,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {31394#true} assume 0 == ~r1~0 % 256; {31394#true} is VALID [2022-02-20 19:54:36,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {31394#true} assume ~id1~0 >= 0; {31394#true} is VALID [2022-02-20 19:54:36,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {31394#true} assume 0 == ~st1~0; {31394#true} is VALID [2022-02-20 19:54:36,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {31394#true} assume ~send1~0 == ~id1~0; {31394#true} is VALID [2022-02-20 19:54:36,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {31394#true} assume 0 == ~mode1~0 % 256; {31394#true} is VALID [2022-02-20 19:54:36,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {31394#true} assume ~id2~0 >= 0; {31394#true} is VALID [2022-02-20 19:54:36,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {31394#true} assume 0 == ~st2~0; {31394#true} is VALID [2022-02-20 19:54:36,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {31394#true} assume ~send2~0 == ~id2~0; {31394#true} is VALID [2022-02-20 19:54:36,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {31394#true} assume 0 == ~mode2~0 % 256; {31394#true} is VALID [2022-02-20 19:54:36,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {31394#true} assume ~id3~0 >= 0; {31394#true} is VALID [2022-02-20 19:54:36,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {31394#true} assume 0 == ~st3~0; {31394#true} is VALID [2022-02-20 19:54:36,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {31394#true} assume ~send3~0 == ~id3~0; {31394#true} is VALID [2022-02-20 19:54:36,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {31394#true} assume 0 == ~mode3~0 % 256; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,866 INFO L290 TraceCheckUtils]: 51: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,867 INFO L290 TraceCheckUtils]: 55: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,871 INFO L290 TraceCheckUtils]: 64: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,872 INFO L290 TraceCheckUtils]: 66: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,873 INFO L290 TraceCheckUtils]: 69: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,874 INFO L290 TraceCheckUtils]: 70: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,874 INFO L290 TraceCheckUtils]: 71: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,875 INFO L290 TraceCheckUtils]: 73: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {31396#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:54:36,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {31396#(= (+ (* (- 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; {31395#false} is VALID [2022-02-20 19:54:36,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {31395#false} assume !(node3_~m3~0#1 != ~nomsg~0); {31395#false} is VALID [2022-02-20 19:54:36,877 INFO L290 TraceCheckUtils]: 79: Hoare triple {31395#false} ~mode3~0 := 0; {31395#false} is VALID [2022-02-20 19:54:36,878 INFO L290 TraceCheckUtils]: 80: Hoare triple {31395#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {31395#false} is VALID [2022-02-20 19:54:36,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {31395#false} assume !(0 != ~mode4~0 % 256); {31395#false} is VALID [2022-02-20 19:54:36,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {31395#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {31395#false} is VALID [2022-02-20 19:54:36,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {31395#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {31395#false} is VALID [2022-02-20 19:54:36,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {31395#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {31395#false} is VALID [2022-02-20 19:54:36,878 INFO L290 TraceCheckUtils]: 85: Hoare triple {31395#false} assume !(0 != ~mode5~0 % 256); {31395#false} is VALID [2022-02-20 19:54:36,878 INFO L290 TraceCheckUtils]: 86: Hoare triple {31395#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {31395#false} is VALID [2022-02-20 19:54:36,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {31395#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {31395#false} is VALID [2022-02-20 19:54:36,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {31395#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {31395#false} is VALID [2022-02-20 19:54:36,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {31395#false} assume !(0 != ~mode6~0 % 256); {31395#false} is VALID [2022-02-20 19:54:36,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {31395#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {31395#false} is VALID [2022-02-20 19:54:36,879 INFO L290 TraceCheckUtils]: 91: Hoare triple {31395#false} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {31395#false} is VALID [2022-02-20 19:54:36,879 INFO L290 TraceCheckUtils]: 92: Hoare triple {31395#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {31395#false} is VALID [2022-02-20 19:54:36,880 INFO L290 TraceCheckUtils]: 93: Hoare triple {31395#false} assume !(0 != ~mode7~0 % 256); {31395#false} is VALID [2022-02-20 19:54:36,880 INFO L290 TraceCheckUtils]: 94: Hoare triple {31395#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {31395#false} is VALID [2022-02-20 19:54:36,880 INFO L290 TraceCheckUtils]: 95: Hoare triple {31395#false} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {31395#false} is VALID [2022-02-20 19:54:36,880 INFO L290 TraceCheckUtils]: 96: Hoare triple {31395#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {31395#false} is VALID [2022-02-20 19:54:36,880 INFO L290 TraceCheckUtils]: 97: Hoare triple {31395#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {31395#false} is VALID [2022-02-20 19:54:36,880 INFO L290 TraceCheckUtils]: 98: Hoare triple {31395#false} assume !(node8_~m8~0#1 != ~nomsg~0); {31395#false} is VALID [2022-02-20 19:54:36,880 INFO L290 TraceCheckUtils]: 99: Hoare triple {31395#false} ~mode8~0 := 0; {31395#false} is VALID [2022-02-20 19:54:36,881 INFO L290 TraceCheckUtils]: 100: Hoare triple {31395#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {31395#false} is VALID [2022-02-20 19:54:36,881 INFO L290 TraceCheckUtils]: 101: Hoare triple {31395#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {31395#false} is VALID [2022-02-20 19:54:36,881 INFO L290 TraceCheckUtils]: 102: Hoare triple {31395#false} check_#res#1 := check_~tmp~1#1; {31395#false} is VALID [2022-02-20 19:54:36,881 INFO L290 TraceCheckUtils]: 103: Hoare triple {31395#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {31395#false} is VALID [2022-02-20 19:54:36,881 INFO L290 TraceCheckUtils]: 104: Hoare triple {31395#false} assume 0 == assert_~arg#1 % 256; {31395#false} is VALID [2022-02-20 19:54:36,881 INFO L290 TraceCheckUtils]: 105: Hoare triple {31395#false} assume !false; {31395#false} is VALID [2022-02-20 19:54:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:36,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:36,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306513722] [2022-02-20 19:54:36,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306513722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:36,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:36,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:36,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600971007] [2022-02-20 19:54:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:36,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:36,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:36,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:36,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:36,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:36,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:36,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:36,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:36,971 INFO L87 Difference]: Start difference. First operand 1846 states and 2922 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:39,015 INFO L93 Difference]: Finished difference Result 2370 states and 3756 transitions. [2022-02-20 19:54:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:39,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:54:40,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:40,690 INFO L225 Difference]: With dead ends: 2370 [2022-02-20 19:54:40,691 INFO L226 Difference]: Without dead ends: 2096 [2022-02-20 19:54:40,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:40,693 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 1542 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:40,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1542 Valid, 1851 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2022-02-20 19:54:40,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2094. [2022-02-20 19:54:40,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:40,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2096 states. Second operand has 2094 states, 2092 states have (on average 1.5841300191204588) internal successors, (3314), 2093 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:40,785 INFO L74 IsIncluded]: Start isIncluded. First operand 2096 states. Second operand has 2094 states, 2092 states have (on average 1.5841300191204588) internal successors, (3314), 2093 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:40,789 INFO L87 Difference]: Start difference. First operand 2096 states. Second operand has 2094 states, 2092 states have (on average 1.5841300191204588) internal successors, (3314), 2093 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:40,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:40,978 INFO L93 Difference]: Finished difference Result 2096 states and 3315 transitions. [2022-02-20 19:54:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3315 transitions. [2022-02-20 19:54:40,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:40,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:40,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 2094 states, 2092 states have (on average 1.5841300191204588) internal successors, (3314), 2093 states have internal predecessors, (3314), 0 states have call successors, (0), 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 2096 states. [2022-02-20 19:54:40,988 INFO L87 Difference]: Start difference. First operand has 2094 states, 2092 states have (on average 1.5841300191204588) internal successors, (3314), 2093 states have internal predecessors, (3314), 0 states have call successors, (0), 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 2096 states. [2022-02-20 19:54:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:41,161 INFO L93 Difference]: Finished difference Result 2096 states and 3315 transitions. [2022-02-20 19:54:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3315 transitions. [2022-02-20 19:54:41,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:41,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:41,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:41,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 2092 states have (on average 1.5841300191204588) internal successors, (3314), 2093 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3314 transitions. [2022-02-20 19:54:41,298 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3314 transitions. Word has length 106 [2022-02-20 19:54:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:41,298 INFO L470 AbstractCegarLoop]: Abstraction has 2094 states and 3314 transitions. [2022-02-20 19:54:41,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3314 transitions. [2022-02-20 19:54:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:41,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:41,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:41,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:54:41,300 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:41,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 832299526, now seen corresponding path program 1 times [2022-02-20 19:54:41,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:41,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419020668] [2022-02-20 19:54:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {40297#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {40297#true} is VALID [2022-02-20 19:54:41,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {40297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {40297#true} is VALID [2022-02-20 19:54:41,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {40297#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40297#true} is VALID [2022-02-20 19:54:41,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {40297#true} assume 0 == ~r1~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {40297#true} assume ~id1~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {40297#true} assume 0 == ~st1~0; {40297#true} is VALID [2022-02-20 19:54:41,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {40297#true} assume ~send1~0 == ~id1~0; {40297#true} is VALID [2022-02-20 19:54:41,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {40297#true} assume 0 == ~mode1~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {40297#true} assume ~id2~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {40297#true} assume 0 == ~st2~0; {40297#true} is VALID [2022-02-20 19:54:41,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {40297#true} assume ~send2~0 == ~id2~0; {40297#true} is VALID [2022-02-20 19:54:41,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {40297#true} assume 0 == ~mode2~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {40297#true} assume ~id3~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {40297#true} assume 0 == ~st3~0; {40297#true} is VALID [2022-02-20 19:54:41,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {40297#true} assume ~send3~0 == ~id3~0; {40297#true} is VALID [2022-02-20 19:54:41,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {40297#true} assume 0 == ~mode3~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {40297#true} assume ~id4~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {40297#true} assume 0 == ~st4~0; {40297#true} is VALID [2022-02-20 19:54:41,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {40297#true} assume ~send4~0 == ~id4~0; {40297#true} is VALID [2022-02-20 19:54:41,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {40297#true} assume 0 == ~mode4~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {40297#true} assume ~id5~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {40297#true} assume 0 == ~st5~0; {40297#true} is VALID [2022-02-20 19:54:41,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {40297#true} assume ~send5~0 == ~id5~0; {40297#true} is VALID [2022-02-20 19:54:41,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {40297#true} assume 0 == ~mode5~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {40297#true} assume ~id6~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {40297#true} assume 0 == ~st6~0; {40297#true} is VALID [2022-02-20 19:54:41,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {40297#true} assume ~send6~0 == ~id6~0; {40297#true} is VALID [2022-02-20 19:54:41,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {40297#true} assume 0 == ~mode6~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {40297#true} assume ~id7~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {40297#true} assume 0 == ~st7~0; {40297#true} is VALID [2022-02-20 19:54:41,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {40297#true} assume ~send7~0 == ~id7~0; {40297#true} is VALID [2022-02-20 19:54:41,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {40297#true} assume 0 == ~mode7~0 % 256; {40297#true} is VALID [2022-02-20 19:54:41,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {40297#true} assume ~id8~0 >= 0; {40297#true} is VALID [2022-02-20 19:54:41,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {40297#true} assume 0 == ~st8~0; {40297#true} is VALID [2022-02-20 19:54:41,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {40297#true} assume ~send8~0 == ~id8~0; {40297#true} is VALID [2022-02-20 19:54:41,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {40297#true} assume 0 == ~mode8~0 % 256; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id2~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id3~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id4~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id5~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id6~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id7~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id8~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id3~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id4~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id5~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id6~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id7~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id8~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id4~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id5~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id6~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id7~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id8~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id5~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id6~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id7~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id8~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id6~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id7~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id8~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id7~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id8~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,398 INFO L290 TraceCheckUtils]: 64: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} init_#res#1 := init_~tmp~0#1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,399 INFO L290 TraceCheckUtils]: 66: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,400 INFO L290 TraceCheckUtils]: 68: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode1~0 % 256); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode2~0 % 256); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,403 INFO L290 TraceCheckUtils]: 75: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,403 INFO L290 TraceCheckUtils]: 76: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode3~0 % 256); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,404 INFO L290 TraceCheckUtils]: 78: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,405 INFO L290 TraceCheckUtils]: 79: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,405 INFO L290 TraceCheckUtils]: 80: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,406 INFO L290 TraceCheckUtils]: 81: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode4~0 % 256); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,406 INFO L290 TraceCheckUtils]: 82: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,407 INFO L290 TraceCheckUtils]: 83: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,407 INFO L290 TraceCheckUtils]: 84: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,407 INFO L290 TraceCheckUtils]: 85: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode5~0 % 256); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,408 INFO L290 TraceCheckUtils]: 86: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,408 INFO L290 TraceCheckUtils]: 87: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,409 INFO L290 TraceCheckUtils]: 88: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode6~0 % 256); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,410 INFO L290 TraceCheckUtils]: 90: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,410 INFO L290 TraceCheckUtils]: 91: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,411 INFO L290 TraceCheckUtils]: 92: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,411 INFO L290 TraceCheckUtils]: 93: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode7~0 % 256); {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,411 INFO L290 TraceCheckUtils]: 94: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,412 INFO L290 TraceCheckUtils]: 95: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,412 INFO L290 TraceCheckUtils]: 96: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:41,413 INFO L290 TraceCheckUtils]: 97: Hoare triple {40299#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {40298#false} is VALID [2022-02-20 19:54:41,413 INFO L290 TraceCheckUtils]: 98: Hoare triple {40298#false} assume !(node8_~m8~0#1 != ~nomsg~0); {40298#false} is VALID [2022-02-20 19:54:41,413 INFO L290 TraceCheckUtils]: 99: Hoare triple {40298#false} ~mode8~0 := 0; {40298#false} is VALID [2022-02-20 19:54:41,413 INFO L290 TraceCheckUtils]: 100: Hoare triple {40298#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40298#false} is VALID [2022-02-20 19:54:41,414 INFO L290 TraceCheckUtils]: 101: Hoare triple {40298#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {40298#false} is VALID [2022-02-20 19:54:41,414 INFO L290 TraceCheckUtils]: 102: Hoare triple {40298#false} check_#res#1 := check_~tmp~1#1; {40298#false} is VALID [2022-02-20 19:54:41,414 INFO L290 TraceCheckUtils]: 103: Hoare triple {40298#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {40298#false} is VALID [2022-02-20 19:54:41,414 INFO L290 TraceCheckUtils]: 104: Hoare triple {40298#false} assume 0 == assert_~arg#1 % 256; {40298#false} is VALID [2022-02-20 19:54:41,414 INFO L290 TraceCheckUtils]: 105: Hoare triple {40298#false} assume !false; {40298#false} is VALID [2022-02-20 19:54:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:41,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:41,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419020668] [2022-02-20 19:54:41,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419020668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:41,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:41,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:41,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050082468] [2022-02-20 19:54:41,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:41,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:41,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:41,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:41,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:41,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:41,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:41,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:41,501 INFO L87 Difference]: Start difference. First operand 2094 states and 3314 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:43,675 INFO L93 Difference]: Finished difference Result 3090 states and 4892 transitions. [2022-02-20 19:54:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:43,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2022-02-20 19:54:43,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1859 transitions. [2022-02-20 19:54:45,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1859 edges. 1859 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:45,425 INFO L225 Difference]: With dead ends: 3090 [2022-02-20 19:54:45,425 INFO L226 Difference]: Without dead ends: 2568 [2022-02-20 19:54:45,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:45,427 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 1522 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:45,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1522 Valid, 1814 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:54:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-02-20 19:54:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2566. [2022-02-20 19:54:45,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:45,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2568 states. Second operand has 2566 states, 2564 states have (on average 1.5811232449297972) internal successors, (4054), 2565 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:45,573 INFO L74 IsIncluded]: Start isIncluded. First operand 2568 states. Second operand has 2566 states, 2564 states have (on average 1.5811232449297972) internal successors, (4054), 2565 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:45,576 INFO L87 Difference]: Start difference. First operand 2568 states. Second operand has 2566 states, 2564 states have (on average 1.5811232449297972) internal successors, (4054), 2565 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:45,815 INFO L93 Difference]: Finished difference Result 2568 states and 4055 transitions. [2022-02-20 19:54:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 4055 transitions. [2022-02-20 19:54:45,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:45,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:45,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 2566 states, 2564 states have (on average 1.5811232449297972) internal successors, (4054), 2565 states have internal predecessors, (4054), 0 states have call successors, (0), 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 2568 states. [2022-02-20 19:54:45,825 INFO L87 Difference]: Start difference. First operand has 2566 states, 2564 states have (on average 1.5811232449297972) internal successors, (4054), 2565 states have internal predecessors, (4054), 0 states have call successors, (0), 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 2568 states. [2022-02-20 19:54:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:46,062 INFO L93 Difference]: Finished difference Result 2568 states and 4055 transitions. [2022-02-20 19:54:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 4055 transitions. [2022-02-20 19:54:46,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:46,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:46,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:46,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2564 states have (on average 1.5811232449297972) internal successors, (4054), 2565 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 4054 transitions. [2022-02-20 19:54:46,280 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 4054 transitions. Word has length 106 [2022-02-20 19:54:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:46,280 INFO L470 AbstractCegarLoop]: Abstraction has 2566 states and 4054 transitions. [2022-02-20 19:54:46,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 4054 transitions. [2022-02-20 19:54:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:46,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:46,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:46,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:54:46,282 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:46,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:46,282 INFO L85 PathProgramCache]: Analyzing trace with hash 2050284924, now seen corresponding path program 1 times [2022-02-20 19:54:46,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:46,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548685255] [2022-02-20 19:54:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:46,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {51556#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {51556#true} is VALID [2022-02-20 19:54:46,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {51556#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {51556#true} is VALID [2022-02-20 19:54:46,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {51556#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51556#true} is VALID [2022-02-20 19:54:46,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {51556#true} assume 0 == ~r1~0 % 256; {51556#true} is VALID [2022-02-20 19:54:46,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {51556#true} assume ~id1~0 >= 0; {51556#true} is VALID [2022-02-20 19:54:46,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {51556#true} assume 0 == ~st1~0; {51558#(<= ~st1~0 0)} is VALID [2022-02-20 19:54:46,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {51558#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {51558#(<= ~st1~0 0)} is VALID [2022-02-20 19:54:46,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {51558#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {51558#(<= ~st1~0 0)} is VALID [2022-02-20 19:54:46,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {51558#(<= ~st1~0 0)} assume ~id2~0 >= 0; {51558#(<= ~st1~0 0)} is VALID [2022-02-20 19:54:46,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {51558#(<= ~st1~0 0)} assume 0 == ~st2~0; {51559#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {51559#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {51559#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {51559#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {51559#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {51559#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {51559#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {51559#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {51560#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {51561#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:54:46,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {51562#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id7~0 >= 0; {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {51563#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~st7~0; {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 == ~id7~0; {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode7~0 % 256; {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume ~id8~0 >= 0; {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {51564#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st7~0 ~st6~0) 0)} assume 0 == ~st8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 == ~id8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume 0 == ~mode8~0 % 256; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,443 INFO L290 TraceCheckUtils]: 38: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id7~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id1~0 != ~id8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id7~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id2~0 != ~id8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id7~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id3~0 != ~id8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id7~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id4~0 != ~id8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id7~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id5~0 != ~id8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id7~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id6~0 != ~id8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,455 INFO L290 TraceCheckUtils]: 66: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,455 INFO L290 TraceCheckUtils]: 67: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,456 INFO L290 TraceCheckUtils]: 69: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,456 INFO L290 TraceCheckUtils]: 70: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,459 INFO L290 TraceCheckUtils]: 75: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,459 INFO L290 TraceCheckUtils]: 76: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,460 INFO L290 TraceCheckUtils]: 77: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,460 INFO L290 TraceCheckUtils]: 79: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,461 INFO L290 TraceCheckUtils]: 80: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,462 INFO L290 TraceCheckUtils]: 82: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,462 INFO L290 TraceCheckUtils]: 83: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,463 INFO L290 TraceCheckUtils]: 84: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,463 INFO L290 TraceCheckUtils]: 85: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,463 INFO L290 TraceCheckUtils]: 86: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,464 INFO L290 TraceCheckUtils]: 87: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,464 INFO L290 TraceCheckUtils]: 88: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,465 INFO L290 TraceCheckUtils]: 89: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,465 INFO L290 TraceCheckUtils]: 90: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,466 INFO L290 TraceCheckUtils]: 91: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,466 INFO L290 TraceCheckUtils]: 92: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,466 INFO L290 TraceCheckUtils]: 93: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode7~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,467 INFO L290 TraceCheckUtils]: 94: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,467 INFO L290 TraceCheckUtils]: 95: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,468 INFO L290 TraceCheckUtils]: 96: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,468 INFO L290 TraceCheckUtils]: 97: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(0 != ~mode8~0 % 256); {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,469 INFO L290 TraceCheckUtils]: 98: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume ~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0;node8_#t~ite12#1 := ~send8~0; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,469 INFO L290 TraceCheckUtils]: 99: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} ~p8_new~0 := (if node8_#t~ite12#1 % 256 <= 127 then node8_#t~ite12#1 % 256 else node8_#t~ite12#1 % 256 - 256);havoc node8_#t~ite12#1;~mode8~0 := 1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,470 INFO L290 TraceCheckUtils]: 100: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} is VALID [2022-02-20 19:54:46,471 INFO L290 TraceCheckUtils]: 101: Hoare triple {51565#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st8~0 ~st7~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {51557#false} is VALID [2022-02-20 19:54:46,471 INFO L290 TraceCheckUtils]: 102: Hoare triple {51557#false} check_#res#1 := check_~tmp~1#1; {51557#false} is VALID [2022-02-20 19:54:46,471 INFO L290 TraceCheckUtils]: 103: Hoare triple {51557#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {51557#false} is VALID [2022-02-20 19:54:46,471 INFO L290 TraceCheckUtils]: 104: Hoare triple {51557#false} assume 0 == assert_~arg#1 % 256; {51557#false} is VALID [2022-02-20 19:54:46,471 INFO L290 TraceCheckUtils]: 105: Hoare triple {51557#false} assume !false; {51557#false} is VALID [2022-02-20 19:54:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:46,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:46,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548685255] [2022-02-20 19:54:46,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548685255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:46,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:46,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:54:46,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830044555] [2022-02-20 19:54:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:46,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:46,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:54:46,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:46,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:54:46,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:54:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:54:46,560 INFO L87 Difference]: Start difference. First operand 2566 states and 4054 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)