./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.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.ufo.UNBOUNDED.pals+Problem12_label04.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 82629eca6c71a457570e41243c2aaef9825ffa804906408a105aaa7b8cd16d36 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:53:19,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:53:19,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:53:19,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:53:19,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:53:19,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:53:19,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:53:19,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:53:19,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:53:19,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:53:19,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:53:19,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:53:19,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:53:19,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:53:19,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:53:19,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:53:19,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:53:19,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:53:19,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:53:19,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:53:19,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:53:19,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:53:19,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:53:19,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:53:19,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:53:19,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:53:19,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:53:19,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:53:19,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:53:19,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:53:19,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:53:19,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:53:19,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:53:19,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:53:19,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:53:19,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:53:19,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:53:19,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:53:19,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:53:19,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:53:19,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:53:19,495 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:19,530 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:53:19,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:53:19,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:53:19,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:53:19,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:53:19,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:53:19,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:53:19,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:53:19,533 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:53:19,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:53:19,534 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:53:19,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:53:19,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:53:19,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:53:19,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:53:19,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:53:19,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:53:19,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:53:19,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:53:19,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:53:19,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:53:19,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:53:19,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:53:19,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:53:19,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:19,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:53:19,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:53:19,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:53:19,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:53:19,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:53:19,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:53:19,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:53:19,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:53:19,540 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 -> 82629eca6c71a457570e41243c2aaef9825ffa804906408a105aaa7b8cd16d36 [2022-02-20 19:53:19,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:53:19,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:53:19,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:53:19,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:53:19,784 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:53:19,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c [2022-02-20 19:53:19,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787a23a1d/e5a17214fa8042a69d96249977d04f69/FLAG72fecf76b [2022-02-20 19:53:20,439 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:53:20,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c [2022-02-20 19:53:20,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787a23a1d/e5a17214fa8042a69d96249977d04f69/FLAG72fecf76b [2022-02-20 19:53:20,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787a23a1d/e5a17214fa8042a69d96249977d04f69 [2022-02-20 19:53:20,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:53:20,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:53:20,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:20,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:53:20,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:53:20,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:20" (1/1) ... [2022-02-20 19:53:20,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b640e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:20, skipping insertion in model container [2022-02-20 19:53:20,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:20" (1/1) ... [2022-02-20 19:53:20,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:53:20,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:53:21,107 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.ufo.UNBOUNDED.pals+Problem12_label04.c[26888,26901] [2022-02-20 19:53:21,179 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.ufo.UNBOUNDED.pals+Problem12_label04.c[33949,33962] [2022-02-20 19:53:21,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:21,832 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:53:21,893 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.ufo.UNBOUNDED.pals+Problem12_label04.c[26888,26901] [2022-02-20 19:53:21,911 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.ufo.UNBOUNDED.pals+Problem12_label04.c[33949,33962] [2022-02-20 19:53:22,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:22,342 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:53:22,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:22 WrapperNode [2022-02-20 19:53:22,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:22,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:22,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:53:22,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:53:22,350 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:22" (1/1) ... [2022-02-20 19:53:22,391 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:22" (1/1) ... [2022-02-20 19:53:22,763 INFO L137 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5279 [2022-02-20 19:53:22,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:22,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:53:22,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:53:22,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:53:22,772 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:22" (1/1) ... [2022-02-20 19:53:22,773 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:22" (1/1) ... [2022-02-20 19:53:22,823 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:22" (1/1) ... [2022-02-20 19:53:22,823 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:22" (1/1) ... [2022-02-20 19:53:22,997 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:22" (1/1) ... [2022-02-20 19:53:23,016 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:22" (1/1) ... [2022-02-20 19:53:23,054 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:22" (1/1) ... [2022-02-20 19:53:23,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:53:23,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:53:23,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:53:23,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:53:23,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:22" (1/1) ... [2022-02-20 19:53:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:23,220 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:23,259 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:23,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:53:23,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:53:23,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:53:23,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:53:23,508 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:53:23,509 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:53:31,288 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:53:31,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:53:31,302 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:53:31,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:31 BoogieIcfgContainer [2022-02-20 19:53:31,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:53:31,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:53:31,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:53:31,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:53:31,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:53:20" (1/3) ... [2022-02-20 19:53:31,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a81212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:31, skipping insertion in model container [2022-02-20 19:53:31,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:22" (2/3) ... [2022-02-20 19:53:31,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a81212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:31, skipping insertion in model container [2022-02-20 19:53:31,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:31" (3/3) ... [2022-02-20 19:53:31,311 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label04.c [2022-02-20 19:53:31,315 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:53:31,316 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:53:31,364 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:53:31,380 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:53:31,383 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:53:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have 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:53:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:31,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:31,430 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:53:31,431 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash -805214309, now seen corresponding path program 1 times [2022-02-20 19:53:31,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:31,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129183412] [2022-02-20 19:53:31,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:31,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {968#true} is VALID [2022-02-20 19:53:31,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#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; {968#true} is VALID [2022-02-20 19:53:31,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#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; {968#true} is VALID [2022-02-20 19:53:31,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {968#true} is VALID [2022-02-20 19:53:31,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#true} init_#res#1 := init_~tmp~0#1; {968#true} is VALID [2022-02-20 19:53:31,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#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; {968#true} is VALID [2022-02-20 19:53:31,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {969#false} is VALID [2022-02-20 19:53:31,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#false} assume !(0 != ~mode1~0 % 256); {969#false} is VALID [2022-02-20 19:53:31,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {969#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {969#false} is VALID [2022-02-20 19:53:31,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {969#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {969#false} is VALID [2022-02-20 19:53:31,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {969#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:31,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {969#false} assume !(node2_~m2~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:31,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {969#false} ~mode2~0 := 0; {969#false} is VALID [2022-02-20 19:53:31,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {969#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:31,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {969#false} assume !(node3_~m3~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:31,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {969#false} ~mode3~0 := 0; {969#false} is VALID [2022-02-20 19:53:31,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {969#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:31,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {969#false} assume !(node4_~m4~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:31,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#false} ~mode4~0 := 0; {969#false} is VALID [2022-02-20 19:53:31,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {969#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:31,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {969#false} assume !(node5_~m5~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:31,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {969#false} ~mode5~0 := 0; {969#false} is VALID [2022-02-20 19:53:31,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {969#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:31,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {969#false} assume !(node6_~m6~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:31,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {969#false} ~mode6~0 := 0; {969#false} is VALID [2022-02-20 19:53:31,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {969#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:31,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {969#false} assume !(node7_~m7~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:31,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {969#false} ~mode7~0 := 0; {969#false} is VALID [2022-02-20 19:53:31,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {969#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:31,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} assume !(node8_~m8~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:31,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {969#false} ~mode8~0 := 0; {969#false} is VALID [2022-02-20 19:53:31,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {969#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {969#false} is VALID [2022-02-20 19:53:31,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {969#false} check_#res#1 := check_~tmp~1#1; {969#false} is VALID [2022-02-20 19:53:31,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:31,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {969#false} assume 0 == assert_~arg#1 % 256; {969#false} is VALID [2022-02-20 19:53:31,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-20 19:53:31,699 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:53:31,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:31,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129183412] [2022-02-20 19:53:31,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129183412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:31,701 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:31,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:31,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468861678] [2022-02-20 19:53:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:31,707 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:53:31,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:31,711 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:53:31,763 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:53:31,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:53:31,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:53:31,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:53:31,791 INFO L87 Difference]: Start difference. First operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 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:53:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:33,259 INFO L93 Difference]: Finished difference Result 1861 states and 3516 transitions. [2022-02-20 19:53:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:53:33,260 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:53:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:33,261 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:53:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:33,296 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:53:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:33,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3516 transitions. [2022-02-20 19:53:36,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3516 edges. 3516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:36,163 INFO L225 Difference]: With dead ends: 1861 [2022-02-20 19:53:36,163 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:36,171 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:53:36,175 INFO L933 BasicCegarLoop]: 1755 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, 1755 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:53:36,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:36,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:36,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:36,252 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:36,256 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:36,301 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:36,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:36,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:36,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:36,310 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:36,352 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:36,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:36,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:36,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:36,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1691 transitions. [2022-02-20 19:53:36,401 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1691 transitions. Word has length 46 [2022-02-20 19:53:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:36,402 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1691 transitions. [2022-02-20 19:53:36,402 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:53:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:36,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:36,404 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:53:36,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:53:36,404 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2117945689, now seen corresponding path program 1 times [2022-02-20 19:53:36,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:36,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781024675] [2022-02-20 19:53:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:36,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {5583#true} is VALID [2022-02-20 19:53:36,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {5583#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; {5583#true} is VALID [2022-02-20 19:53:36,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {5583#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; {5583#true} is VALID [2022-02-20 19:53:36,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {5583#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:53:36,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5586#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:53:36,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {5586#(= |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; {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:53:36,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5584#false} is VALID [2022-02-20 19:53:36,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#false} assume !(0 != ~mode1~0 % 256); {5584#false} is VALID [2022-02-20 19:53:36,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {5584#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5584#false} is VALID [2022-02-20 19:53:36,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5584#false} is VALID [2022-02-20 19:53:36,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:36,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {5584#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:36,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {5584#false} ~mode2~0 := 0; {5584#false} is VALID [2022-02-20 19:53:36,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:36,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {5584#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:36,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {5584#false} ~mode3~0 := 0; {5584#false} is VALID [2022-02-20 19:53:36,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {5584#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:36,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {5584#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:36,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {5584#false} ~mode4~0 := 0; {5584#false} is VALID [2022-02-20 19:53:36,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {5584#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:36,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {5584#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:36,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {5584#false} ~mode5~0 := 0; {5584#false} is VALID [2022-02-20 19:53:36,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {5584#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:36,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {5584#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:36,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {5584#false} ~mode6~0 := 0; {5584#false} is VALID [2022-02-20 19:53:36,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {5584#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:36,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {5584#false} assume !(node7_~m7~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:36,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {5584#false} ~mode7~0 := 0; {5584#false} is VALID [2022-02-20 19:53:36,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {5584#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:36,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {5584#false} assume !(node8_~m8~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:36,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {5584#false} ~mode8~0 := 0; {5584#false} is VALID [2022-02-20 19:53:36,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {5584#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {5584#false} is VALID [2022-02-20 19:53:36,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {5584#false} check_#res#1 := check_~tmp~1#1; {5584#false} is VALID [2022-02-20 19:53:36,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:36,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {5584#false} assume 0 == assert_~arg#1 % 256; {5584#false} is VALID [2022-02-20 19:53:36,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {5584#false} assume !false; {5584#false} is VALID [2022-02-20 19:53:36,543 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:53:36,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:36,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781024675] [2022-02-20 19:53:36,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781024675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:36,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:36,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:53:36,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341927514] [2022-02-20 19:53:36,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:36,545 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:53:36,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:36,546 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:53:36,575 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:53:36,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:53:36,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:36,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:53:36,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:36,577 INFO L87 Difference]: Start difference. First operand 899 states and 1691 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:53:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:40,912 INFO L93 Difference]: Finished difference Result 981 states and 1819 transitions. [2022-02-20 19:53:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:40,912 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:53:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:40,912 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:53:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:40,922 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:53:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:40,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1819 transitions. [2022-02-20 19:53:42,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:42,444 INFO L225 Difference]: With dead ends: 981 [2022-02-20 19:53:42,444 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:42,448 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:53:42,450 INFO L933 BasicCegarLoop]: 1689 mSDtfsCounter, 3 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:42,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6692 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:42,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:42,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:42,474 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:42,477 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:42,520 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:42,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:42,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:42,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:42,530 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:42,574 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:42,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:42,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:42,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:42,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1630 transitions. [2022-02-20 19:53:42,626 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1630 transitions. Word has length 46 [2022-02-20 19:53:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:42,627 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1630 transitions. [2022-02-20 19:53:42,627 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:53:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 19:53:42,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:42,631 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] [2022-02-20 19:53:42,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:53:42,632 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash 22985667, now seen corresponding path program 1 times [2022-02-20 19:53:42,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:42,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812369831] [2022-02-20 19:53:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:42,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {9318#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {9320#(<= (+ ~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; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {9320#(<= (+ ~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; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {9320#(<= (+ ~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; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {9320#(<= (+ ~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; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,849 INFO L290 TraceCheckUtils]: 58: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:42,849 INFO L290 TraceCheckUtils]: 59: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9319#false} is VALID [2022-02-20 19:53:42,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {9319#false} assume !false; {9319#false} is VALID [2022-02-20 19:53:42,850 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:53:42,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:42,851 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812369831] [2022-02-20 19:53:42,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812369831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:42,851 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:42,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:42,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239524140] [2022-02-20 19:53:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 19:53:42,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:42,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:53:42,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:42,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:42,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:42,909 INFO L87 Difference]: Start difference. First operand 899 states and 1630 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:53:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:48,762 INFO L93 Difference]: Finished difference Result 2403 states and 4503 transitions. [2022-02-20 19:53:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:48,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-02-20 19:53:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:53:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:53:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:53:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:53:48,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4503 transitions. [2022-02-20 19:53:52,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4503 edges. 4503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:52,492 INFO L225 Difference]: With dead ends: 2403 [2022-02-20 19:53:52,492 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:53:52,493 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:53:52,494 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 931 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 666 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:53:52,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 666 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 19:53:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:53:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-02-20 19:53:52,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:52,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:52,534 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:52,537 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:52,669 INFO L93 Difference]: Finished difference Result 1650 states and 2609 transitions. [2022-02-20 19:53:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2609 transitions. [2022-02-20 19:53:52,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:52,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:52,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:52,680 INFO L87 Difference]: Start difference. First operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:52,817 INFO L93 Difference]: Finished difference Result 1650 states and 2609 transitions. [2022-02-20 19:53:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2609 transitions. [2022-02-20 19:53:52,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:52,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:52,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:52,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2609 transitions. [2022-02-20 19:53:52,947 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2609 transitions. Word has length 61 [2022-02-20 19:53:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:52,948 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 2609 transitions. [2022-02-20 19:53:52,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:53:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2609 transitions. [2022-02-20 19:53:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:52,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:52,950 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:53:52,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:53:52,951 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash 211182729, now seen corresponding path program 1 times [2022-02-20 19:53:52,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:52,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332309467] [2022-02-20 19:53:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:53,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {16725#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {16725#true} is VALID [2022-02-20 19:53:53,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {16725#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; {16725#true} is VALID [2022-02-20 19:53:53,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {16725#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; {16725#true} is VALID [2022-02-20 19:53:53,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {16725#true} assume 0 == ~r1~0 % 256; {16725#true} is VALID [2022-02-20 19:53:53,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {16725#true} assume ~id1~0 >= 0; {16725#true} is VALID [2022-02-20 19:53:53,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {16725#true} assume 0 == ~st1~0; {16725#true} is VALID [2022-02-20 19:53:53,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {16725#true} assume ~send1~0 == ~id1~0; {16725#true} is VALID [2022-02-20 19:53:53,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {16725#true} assume 0 == ~mode1~0 % 256; {16725#true} is VALID [2022-02-20 19:53:53,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {16725#true} assume ~id2~0 >= 0; {16725#true} is VALID [2022-02-20 19:53:53,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {16725#true} assume 0 == ~st2~0; {16725#true} is VALID [2022-02-20 19:53:53,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {16725#true} assume ~send2~0 == ~id2~0; {16725#true} is VALID [2022-02-20 19:53:53,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {16725#true} assume 0 == ~mode2~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:53,121 INFO L290 TraceCheckUtils]: 73: Hoare triple {16727#(= (+ (* (- 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; {16726#false} is VALID [2022-02-20 19:53:53,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {16726#false} assume !(node2_~m2~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:53,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {16726#false} ~mode2~0 := 0; {16726#false} is VALID [2022-02-20 19:53:53,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {16726#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:53,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {16726#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:53,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {16726#false} ~mode3~0 := 0; {16726#false} is VALID [2022-02-20 19:53:53,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,122 INFO L290 TraceCheckUtils]: 81: Hoare triple {16726#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:53,122 INFO L290 TraceCheckUtils]: 82: Hoare triple {16726#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:53,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {16726#false} ~mode4~0 := 0; {16726#false} is VALID [2022-02-20 19:53:53,123 INFO L290 TraceCheckUtils]: 84: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,123 INFO L290 TraceCheckUtils]: 85: Hoare triple {16726#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:53,123 INFO L290 TraceCheckUtils]: 86: Hoare triple {16726#false} assume !(node5_~m5~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:53,123 INFO L290 TraceCheckUtils]: 87: Hoare triple {16726#false} ~mode5~0 := 0; {16726#false} is VALID [2022-02-20 19:53:53,123 INFO L290 TraceCheckUtils]: 88: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,124 INFO L290 TraceCheckUtils]: 89: Hoare triple {16726#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:53,124 INFO L290 TraceCheckUtils]: 90: Hoare triple {16726#false} assume !(node6_~m6~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:53,124 INFO L290 TraceCheckUtils]: 91: Hoare triple {16726#false} ~mode6~0 := 0; {16726#false} is VALID [2022-02-20 19:53:53,124 INFO L290 TraceCheckUtils]: 92: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,125 INFO L290 TraceCheckUtils]: 93: Hoare triple {16726#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:53,125 INFO L290 TraceCheckUtils]: 94: Hoare triple {16726#false} assume !(node7_~m7~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:53,125 INFO L290 TraceCheckUtils]: 95: Hoare triple {16726#false} ~mode7~0 := 0; {16726#false} is VALID [2022-02-20 19:53:53,125 INFO L290 TraceCheckUtils]: 96: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,125 INFO L290 TraceCheckUtils]: 97: Hoare triple {16726#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:53,125 INFO L290 TraceCheckUtils]: 98: Hoare triple {16726#false} assume !(node8_~m8~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:53,126 INFO L290 TraceCheckUtils]: 99: Hoare triple {16726#false} ~mode8~0 := 0; {16726#false} is VALID [2022-02-20 19:53:53,130 INFO L290 TraceCheckUtils]: 100: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,131 INFO L290 TraceCheckUtils]: 101: Hoare triple {16726#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {16726#false} is VALID [2022-02-20 19:53:53,131 INFO L290 TraceCheckUtils]: 102: Hoare triple {16726#false} check_#res#1 := check_~tmp~1#1; {16726#false} is VALID [2022-02-20 19:53:53,131 INFO L290 TraceCheckUtils]: 103: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:53,131 INFO L290 TraceCheckUtils]: 104: Hoare triple {16726#false} assume 0 == assert_~arg#1 % 256; {16726#false} is VALID [2022-02-20 19:53:53,131 INFO L290 TraceCheckUtils]: 105: Hoare triple {16726#false} assume !false; {16726#false} is VALID [2022-02-20 19:53:53,132 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:53:53,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:53,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332309467] [2022-02-20 19:53:53,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332309467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:53,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:53,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:53,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555947771] [2022-02-20 19:53:53,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:53,134 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:53:53,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:53,134 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:53:53,201 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:53:53,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:53,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:53,203 INFO L87 Difference]: Start difference. First operand 1650 states and 2609 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:53:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:55,383 INFO L93 Difference]: Finished difference Result 1800 states and 2847 transitions. [2022-02-20 19:53:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:55,383 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:53:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:55,384 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:53:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:55,394 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:53:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:55,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:56,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:57,063 INFO L225 Difference]: With dead ends: 1800 [2022-02-20 19:53:57,063 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 19:53:57,063 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:53:57,066 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 1549 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1850 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:53:57,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 1850 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 19:53:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2022-02-20 19:53:57,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:57,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:57,113 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:57,115 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:57,251 INFO L93 Difference]: Finished difference Result 1722 states and 2722 transitions. [2022-02-20 19:53:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2722 transitions. [2022-02-20 19:53:57,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:57,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:57,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:53:57,260 INFO L87 Difference]: Start difference. First operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:53:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:57,393 INFO L93 Difference]: Finished difference Result 1722 states and 2722 transitions. [2022-02-20 19:53:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2722 transitions. [2022-02-20 19:53:57,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:57,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:57,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:57,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2721 transitions. [2022-02-20 19:53:57,544 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2721 transitions. Word has length 106 [2022-02-20 19:53:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:57,545 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 2721 transitions. [2022-02-20 19:53:57,545 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:53:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2721 transitions. [2022-02-20 19:53:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:57,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:57,547 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:53:57,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:53:57,547 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1458691583, now seen corresponding path program 1 times [2022-02-20 19:53:57,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:57,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006908479] [2022-02-20 19:53:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:57,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {23771#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {23771#true} is VALID [2022-02-20 19:53:57,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {23771#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; {23771#true} is VALID [2022-02-20 19:53:57,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {23771#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; {23771#true} is VALID [2022-02-20 19:53:57,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {23771#true} assume 0 == ~r1~0 % 256; {23771#true} is VALID [2022-02-20 19:53:57,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {23771#true} assume ~id1~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:57,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {23771#true} assume 0 == ~st1~0; {23771#true} is VALID [2022-02-20 19:53:57,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {23771#true} assume ~send1~0 == ~id1~0; {23771#true} is VALID [2022-02-20 19:53:57,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {23771#true} assume 0 == ~mode1~0 % 256; {23771#true} is VALID [2022-02-20 19:53:57,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {23771#true} assume ~id2~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:57,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {23771#true} assume 0 == ~st2~0; {23771#true} is VALID [2022-02-20 19:53:57,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {23771#true} assume ~send2~0 == ~id2~0; {23771#true} is VALID [2022-02-20 19:53:57,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {23771#true} assume 0 == ~mode2~0 % 256; {23771#true} is VALID [2022-02-20 19:53:57,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {23771#true} assume ~id3~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:57,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {23771#true} assume 0 == ~st3~0; {23771#true} is VALID [2022-02-20 19:53:57,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {23771#true} assume ~send3~0 == ~id3~0; {23771#true} is VALID [2022-02-20 19:53:57,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {23771#true} assume 0 == ~mode3~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,701 INFO L290 TraceCheckUtils]: 57: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,703 INFO L290 TraceCheckUtils]: 60: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,703 INFO L290 TraceCheckUtils]: 61: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,705 INFO L290 TraceCheckUtils]: 64: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,706 INFO L290 TraceCheckUtils]: 67: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,706 INFO L290 TraceCheckUtils]: 68: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,707 INFO L290 TraceCheckUtils]: 70: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,708 INFO L290 TraceCheckUtils]: 71: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,708 INFO L290 TraceCheckUtils]: 72: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,709 INFO L290 TraceCheckUtils]: 73: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,709 INFO L290 TraceCheckUtils]: 74: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,710 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:57,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {23773#(= (+ (* (- 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; {23772#false} is VALID [2022-02-20 19:53:57,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {23772#false} assume !(node3_~m3~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:57,711 INFO L290 TraceCheckUtils]: 79: Hoare triple {23772#false} ~mode3~0 := 0; {23772#false} is VALID [2022-02-20 19:53:57,712 INFO L290 TraceCheckUtils]: 80: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:57,717 INFO L290 TraceCheckUtils]: 81: Hoare triple {23772#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:57,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {23772#false} assume !(node4_~m4~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:57,717 INFO L290 TraceCheckUtils]: 83: Hoare triple {23772#false} ~mode4~0 := 0; {23772#false} is VALID [2022-02-20 19:53:57,717 INFO L290 TraceCheckUtils]: 84: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:57,717 INFO L290 TraceCheckUtils]: 85: Hoare triple {23772#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:57,718 INFO L290 TraceCheckUtils]: 86: Hoare triple {23772#false} assume !(node5_~m5~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:57,718 INFO L290 TraceCheckUtils]: 87: Hoare triple {23772#false} ~mode5~0 := 0; {23772#false} is VALID [2022-02-20 19:53:57,718 INFO L290 TraceCheckUtils]: 88: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:57,718 INFO L290 TraceCheckUtils]: 89: Hoare triple {23772#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:57,718 INFO L290 TraceCheckUtils]: 90: Hoare triple {23772#false} assume !(node6_~m6~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:57,718 INFO L290 TraceCheckUtils]: 91: Hoare triple {23772#false} ~mode6~0 := 0; {23772#false} is VALID [2022-02-20 19:53:57,719 INFO L290 TraceCheckUtils]: 92: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:57,719 INFO L290 TraceCheckUtils]: 93: Hoare triple {23772#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:57,719 INFO L290 TraceCheckUtils]: 94: Hoare triple {23772#false} assume !(node7_~m7~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:57,719 INFO L290 TraceCheckUtils]: 95: Hoare triple {23772#false} ~mode7~0 := 0; {23772#false} is VALID [2022-02-20 19:53:57,719 INFO L290 TraceCheckUtils]: 96: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:57,721 INFO L290 TraceCheckUtils]: 97: Hoare triple {23772#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:57,721 INFO L290 TraceCheckUtils]: 98: Hoare triple {23772#false} assume !(node8_~m8~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:57,721 INFO L290 TraceCheckUtils]: 99: Hoare triple {23772#false} ~mode8~0 := 0; {23772#false} is VALID [2022-02-20 19:53:57,721 INFO L290 TraceCheckUtils]: 100: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:57,721 INFO L290 TraceCheckUtils]: 101: Hoare triple {23772#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {23772#false} is VALID [2022-02-20 19:53:57,722 INFO L290 TraceCheckUtils]: 102: Hoare triple {23772#false} check_#res#1 := check_~tmp~1#1; {23772#false} is VALID [2022-02-20 19:53:57,722 INFO L290 TraceCheckUtils]: 103: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:57,722 INFO L290 TraceCheckUtils]: 104: Hoare triple {23772#false} assume 0 == assert_~arg#1 % 256; {23772#false} is VALID [2022-02-20 19:53:57,722 INFO L290 TraceCheckUtils]: 105: Hoare triple {23772#false} assume !false; {23772#false} is VALID [2022-02-20 19:53:57,724 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:53:57,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:57,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006908479] [2022-02-20 19:53:57,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006908479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:57,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:57,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:57,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805353131] [2022-02-20 19:53:57,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:57,726 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:53:57,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:57,727 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:53:57,797 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:53:57,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:57,797 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:57,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:57,798 INFO L87 Difference]: Start difference. First operand 1720 states and 2721 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:53:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:59,643 INFO L93 Difference]: Finished difference Result 2004 states and 3173 transitions. [2022-02-20 19:53:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:59,644 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:53:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:59,644 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:53:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:59,650 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:53:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:59,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:01,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:01,305 INFO L225 Difference]: With dead ends: 2004 [2022-02-20 19:54:01,305 INFO L226 Difference]: Without dead ends: 1856 [2022-02-20 19:54:01,305 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:01,306 INFO L933 BasicCegarLoop]: 1719 mSDtfsCounter, 1545 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1849 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:01,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1545 Valid, 1849 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:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2022-02-20 19:54:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1854. [2022-02-20 19:54:01,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:01,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:01,363 INFO L74 IsIncluded]: Start isIncluded. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:01,365 INFO L87 Difference]: Start difference. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:01,468 INFO L93 Difference]: Finished difference Result 1856 states and 2935 transitions. [2022-02-20 19:54:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2935 transitions. [2022-02-20 19:54:01,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:01,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:01,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 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 1856 states. [2022-02-20 19:54:01,476 INFO L87 Difference]: Start difference. First operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 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 1856 states. [2022-02-20 19:54:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:01,587 INFO L93 Difference]: Finished difference Result 1856 states and 2935 transitions. [2022-02-20 19:54:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2935 transitions. [2022-02-20 19:54:01,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:01,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:01,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:01,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2934 transitions. [2022-02-20 19:54:01,693 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2934 transitions. Word has length 106 [2022-02-20 19:54:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:01,693 INFO L470 AbstractCegarLoop]: Abstraction has 1854 states and 2934 transitions. [2022-02-20 19:54:01,694 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:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2934 transitions. [2022-02-20 19:54:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:01,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:01,695 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:01,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:54:01,695 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:01,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 717259381, now seen corresponding path program 1 times [2022-02-20 19:54:01,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:01,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446011491] [2022-02-20 19:54:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:01,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {31478#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {31478#true} is VALID [2022-02-20 19:54:01,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {31478#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; {31478#true} is VALID [2022-02-20 19:54:01,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {31478#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; {31478#true} is VALID [2022-02-20 19:54:01,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {31478#true} assume 0 == ~r1~0 % 256; {31478#true} is VALID [2022-02-20 19:54:01,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {31478#true} assume ~id1~0 >= 0; {31478#true} is VALID [2022-02-20 19:54:01,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {31478#true} assume 0 == ~st1~0; {31478#true} is VALID [2022-02-20 19:54:01,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {31478#true} assume ~send1~0 == ~id1~0; {31478#true} is VALID [2022-02-20 19:54:01,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {31478#true} assume 0 == ~mode1~0 % 256; {31478#true} is VALID [2022-02-20 19:54:01,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {31478#true} assume ~id2~0 >= 0; {31478#true} is VALID [2022-02-20 19:54:01,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {31478#true} assume 0 == ~st2~0; {31478#true} is VALID [2022-02-20 19:54:01,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {31478#true} assume ~send2~0 == ~id2~0; {31478#true} is VALID [2022-02-20 19:54:01,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {31478#true} assume 0 == ~mode2~0 % 256; {31478#true} is VALID [2022-02-20 19:54:01,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {31478#true} assume ~id3~0 >= 0; {31478#true} is VALID [2022-02-20 19:54:01,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {31478#true} assume 0 == ~st3~0; {31478#true} is VALID [2022-02-20 19:54:01,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {31478#true} assume ~send3~0 == ~id3~0; {31478#true} is VALID [2022-02-20 19:54:01,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {31478#true} assume 0 == ~mode3~0 % 256; {31478#true} is VALID [2022-02-20 19:54:01,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {31478#true} assume ~id4~0 >= 0; {31478#true} is VALID [2022-02-20 19:54:01,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {31478#true} assume 0 == ~st4~0; {31478#true} is VALID [2022-02-20 19:54:01,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {31478#true} assume ~send4~0 == ~id4~0; {31478#true} is VALID [2022-02-20 19:54:01,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {31478#true} assume 0 == ~mode4~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,798 INFO L290 TraceCheckUtils]: 51: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,798 INFO L290 TraceCheckUtils]: 52: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,799 INFO L290 TraceCheckUtils]: 54: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,799 INFO L290 TraceCheckUtils]: 55: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,803 INFO L290 TraceCheckUtils]: 64: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,805 INFO L290 TraceCheckUtils]: 68: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,807 INFO L290 TraceCheckUtils]: 71: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,808 INFO L290 TraceCheckUtils]: 73: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,808 INFO L290 TraceCheckUtils]: 74: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,809 INFO L290 TraceCheckUtils]: 75: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,811 INFO L290 TraceCheckUtils]: 79: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,811 INFO L290 TraceCheckUtils]: 80: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:54:01,812 INFO L290 TraceCheckUtils]: 81: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:54:01,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {31479#false} assume !(node4_~m4~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:54:01,812 INFO L290 TraceCheckUtils]: 83: Hoare triple {31479#false} ~mode4~0 := 0; {31479#false} is VALID [2022-02-20 19:54:01,812 INFO L290 TraceCheckUtils]: 84: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:54:01,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {31479#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:54:01,813 INFO L290 TraceCheckUtils]: 86: Hoare triple {31479#false} assume !(node5_~m5~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:54:01,813 INFO L290 TraceCheckUtils]: 87: Hoare triple {31479#false} ~mode5~0 := 0; {31479#false} is VALID [2022-02-20 19:54:01,813 INFO L290 TraceCheckUtils]: 88: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:54:01,813 INFO L290 TraceCheckUtils]: 89: Hoare triple {31479#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:54:01,813 INFO L290 TraceCheckUtils]: 90: Hoare triple {31479#false} assume !(node6_~m6~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:54:01,814 INFO L290 TraceCheckUtils]: 91: Hoare triple {31479#false} ~mode6~0 := 0; {31479#false} is VALID [2022-02-20 19:54:01,814 INFO L290 TraceCheckUtils]: 92: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:54:01,814 INFO L290 TraceCheckUtils]: 93: Hoare triple {31479#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:54:01,814 INFO L290 TraceCheckUtils]: 94: Hoare triple {31479#false} assume !(node7_~m7~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:54:01,814 INFO L290 TraceCheckUtils]: 95: Hoare triple {31479#false} ~mode7~0 := 0; {31479#false} is VALID [2022-02-20 19:54:01,814 INFO L290 TraceCheckUtils]: 96: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:54:01,815 INFO L290 TraceCheckUtils]: 97: Hoare triple {31479#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:54:01,815 INFO L290 TraceCheckUtils]: 98: Hoare triple {31479#false} assume !(node8_~m8~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:54:01,815 INFO L290 TraceCheckUtils]: 99: Hoare triple {31479#false} ~mode8~0 := 0; {31479#false} is VALID [2022-02-20 19:54:01,815 INFO L290 TraceCheckUtils]: 100: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:54:01,815 INFO L290 TraceCheckUtils]: 101: Hoare triple {31479#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {31479#false} is VALID [2022-02-20 19:54:01,815 INFO L290 TraceCheckUtils]: 102: Hoare triple {31479#false} check_#res#1 := check_~tmp~1#1; {31479#false} is VALID [2022-02-20 19:54:01,816 INFO L290 TraceCheckUtils]: 103: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:54:01,816 INFO L290 TraceCheckUtils]: 104: Hoare triple {31479#false} assume 0 == assert_~arg#1 % 256; {31479#false} is VALID [2022-02-20 19:54:01,816 INFO L290 TraceCheckUtils]: 105: Hoare triple {31479#false} assume !false; {31479#false} is VALID [2022-02-20 19:54:01,816 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:01,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:01,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446011491] [2022-02-20 19:54:01,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446011491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:01,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:01,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:01,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269675401] [2022-02-20 19:54:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:01,818 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:01,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:01,819 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:01,897 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:01,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:01,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:01,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:01,898 INFO L87 Difference]: Start difference. First operand 1854 states and 2934 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:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:03,856 INFO L93 Difference]: Finished difference Result 2394 states and 3792 transitions. [2022-02-20 19:54:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:03,856 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:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:03,857 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:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:03,863 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:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:03,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:05,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:05,552 INFO L225 Difference]: With dead ends: 2394 [2022-02-20 19:54:05,552 INFO L226 Difference]: Without dead ends: 2112 [2022-02-20 19:54:05,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:05,553 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 1541 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1848 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:05,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 1848 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:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-02-20 19:54:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2110. [2022-02-20 19:54:05,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:05,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:05,645 INFO L74 IsIncluded]: Start isIncluded. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:05,647 INFO L87 Difference]: Start difference. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:05,821 INFO L93 Difference]: Finished difference Result 2112 states and 3339 transitions. [2022-02-20 19:54:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3339 transitions. [2022-02-20 19:54:05,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:05,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:05,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 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 2112 states. [2022-02-20 19:54:05,830 INFO L87 Difference]: Start difference. First operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 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 2112 states. [2022-02-20 19:54:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:06,014 INFO L93 Difference]: Finished difference Result 2112 states and 3339 transitions. [2022-02-20 19:54:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3339 transitions. [2022-02-20 19:54:06,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:06,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:06,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:06,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 3338 transitions. [2022-02-20 19:54:06,158 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 3338 transitions. Word has length 106 [2022-02-20 19:54:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:06,158 INFO L470 AbstractCegarLoop]: Abstraction has 2110 states and 3338 transitions. [2022-02-20 19:54:06,158 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:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3338 transitions. [2022-02-20 19:54:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:06,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:06,159 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:06,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:54:06,160 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash -28323349, now seen corresponding path program 1 times [2022-02-20 19:54:06,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:06,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015060360] [2022-02-20 19:54:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:06,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {40453#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {40453#true} is VALID [2022-02-20 19:54:06,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {40453#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; {40453#true} is VALID [2022-02-20 19:54:06,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {40453#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; {40453#true} is VALID [2022-02-20 19:54:06,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {40453#true} assume 0 == ~r1~0 % 256; {40453#true} is VALID [2022-02-20 19:54:06,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {40453#true} assume ~id1~0 >= 0; {40453#true} is VALID [2022-02-20 19:54:06,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {40453#true} assume 0 == ~st1~0; {40453#true} is VALID [2022-02-20 19:54:06,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {40453#true} assume ~send1~0 == ~id1~0; {40453#true} is VALID [2022-02-20 19:54:06,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {40453#true} assume 0 == ~mode1~0 % 256; {40453#true} is VALID [2022-02-20 19:54:06,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {40453#true} assume ~id2~0 >= 0; {40453#true} is VALID [2022-02-20 19:54:06,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {40453#true} assume 0 == ~st2~0; {40453#true} is VALID [2022-02-20 19:54:06,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {40453#true} assume ~send2~0 == ~id2~0; {40453#true} is VALID [2022-02-20 19:54:06,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {40453#true} assume 0 == ~mode2~0 % 256; {40453#true} is VALID [2022-02-20 19:54:06,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {40453#true} assume ~id3~0 >= 0; {40453#true} is VALID [2022-02-20 19:54:06,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {40453#true} assume 0 == ~st3~0; {40453#true} is VALID [2022-02-20 19:54:06,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {40453#true} assume ~send3~0 == ~id3~0; {40453#true} is VALID [2022-02-20 19:54:06,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {40453#true} assume 0 == ~mode3~0 % 256; {40453#true} is VALID [2022-02-20 19:54:06,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {40453#true} assume ~id4~0 >= 0; {40453#true} is VALID [2022-02-20 19:54:06,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {40453#true} assume 0 == ~st4~0; {40453#true} is VALID [2022-02-20 19:54:06,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {40453#true} assume ~send4~0 == ~id4~0; {40453#true} is VALID [2022-02-20 19:54:06,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {40453#true} assume 0 == ~mode4~0 % 256; {40453#true} is VALID [2022-02-20 19:54:06,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {40453#true} assume ~id5~0 >= 0; {40453#true} is VALID [2022-02-20 19:54:06,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {40453#true} assume 0 == ~st5~0; {40453#true} is VALID [2022-02-20 19:54:06,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {40453#true} assume ~send5~0 == ~id5~0; {40453#true} is VALID [2022-02-20 19:54:06,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {40453#true} assume 0 == ~mode5~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,283 INFO L290 TraceCheckUtils]: 60: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,283 INFO L290 TraceCheckUtils]: 61: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,283 INFO L290 TraceCheckUtils]: 62: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,284 INFO L290 TraceCheckUtils]: 64: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,286 INFO L290 TraceCheckUtils]: 67: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,286 INFO L290 TraceCheckUtils]: 68: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,291 INFO L290 TraceCheckUtils]: 79: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,291 INFO L290 TraceCheckUtils]: 80: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,292 INFO L290 TraceCheckUtils]: 81: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,293 INFO L290 TraceCheckUtils]: 83: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,293 INFO L290 TraceCheckUtils]: 84: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:54:06,294 INFO L290 TraceCheckUtils]: 85: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:54:06,294 INFO L290 TraceCheckUtils]: 86: Hoare triple {40454#false} assume !(node5_~m5~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:54:06,294 INFO L290 TraceCheckUtils]: 87: Hoare triple {40454#false} ~mode5~0 := 0; {40454#false} is VALID [2022-02-20 19:54:06,294 INFO L290 TraceCheckUtils]: 88: Hoare triple {40454#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; {40454#false} is VALID [2022-02-20 19:54:06,294 INFO L290 TraceCheckUtils]: 89: Hoare triple {40454#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:54:06,294 INFO L290 TraceCheckUtils]: 90: Hoare triple {40454#false} assume !(node6_~m6~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:54:06,294 INFO L290 TraceCheckUtils]: 91: Hoare triple {40454#false} ~mode6~0 := 0; {40454#false} is VALID [2022-02-20 19:54:06,295 INFO L290 TraceCheckUtils]: 92: Hoare triple {40454#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; {40454#false} is VALID [2022-02-20 19:54:06,295 INFO L290 TraceCheckUtils]: 93: Hoare triple {40454#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:54:06,295 INFO L290 TraceCheckUtils]: 94: Hoare triple {40454#false} assume !(node7_~m7~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:54:06,295 INFO L290 TraceCheckUtils]: 95: Hoare triple {40454#false} ~mode7~0 := 0; {40454#false} is VALID [2022-02-20 19:54:06,295 INFO L290 TraceCheckUtils]: 96: Hoare triple {40454#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; {40454#false} is VALID [2022-02-20 19:54:06,295 INFO L290 TraceCheckUtils]: 97: Hoare triple {40454#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:54:06,295 INFO L290 TraceCheckUtils]: 98: Hoare triple {40454#false} assume !(node8_~m8~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:54:06,296 INFO L290 TraceCheckUtils]: 99: Hoare triple {40454#false} ~mode8~0 := 0; {40454#false} is VALID [2022-02-20 19:54:06,296 INFO L290 TraceCheckUtils]: 100: Hoare triple {40454#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; {40454#false} is VALID [2022-02-20 19:54:06,296 INFO L290 TraceCheckUtils]: 101: Hoare triple {40454#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {40454#false} is VALID [2022-02-20 19:54:06,296 INFO L290 TraceCheckUtils]: 102: Hoare triple {40454#false} check_#res#1 := check_~tmp~1#1; {40454#false} is VALID [2022-02-20 19:54:06,296 INFO L290 TraceCheckUtils]: 103: Hoare triple {40454#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; {40454#false} is VALID [2022-02-20 19:54:06,296 INFO L290 TraceCheckUtils]: 104: Hoare triple {40454#false} assume 0 == assert_~arg#1 % 256; {40454#false} is VALID [2022-02-20 19:54:06,296 INFO L290 TraceCheckUtils]: 105: Hoare triple {40454#false} assume !false; {40454#false} is VALID [2022-02-20 19:54:06,297 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,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:06,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015060360] [2022-02-20 19:54:06,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015060360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:06,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:06,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:06,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258989706] [2022-02-20 19:54:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:06,299 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:06,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:06,299 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:06,385 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:06,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:06,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:06,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:06,387 INFO L87 Difference]: Start difference. First operand 2110 states and 3338 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:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:08,548 INFO L93 Difference]: Finished difference Result 3138 states and 4964 transitions. [2022-02-20 19:54:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:08,548 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:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:08,549 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:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:08,554 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:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:08,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:10,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:10,259 INFO L225 Difference]: With dead ends: 3138 [2022-02-20 19:54:10,260 INFO L226 Difference]: Without dead ends: 2600 [2022-02-20 19:54:10,261 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:10,261 INFO L933 BasicCegarLoop]: 1709 mSDtfsCounter, 1537 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1847 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:10,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1847 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:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2022-02-20 19:54:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2598. [2022-02-20 19:54:10,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:10,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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:10,401 INFO L74 IsIncluded]: Start isIncluded. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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:10,404 INFO L87 Difference]: Start difference. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:10,622 INFO L93 Difference]: Finished difference Result 2600 states and 4103 transitions. [2022-02-20 19:54:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4103 transitions. [2022-02-20 19:54:10,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:10,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:10,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 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 2600 states. [2022-02-20 19:54:10,630 INFO L87 Difference]: Start difference. First operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 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 2600 states. [2022-02-20 19:54:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:10,822 INFO L93 Difference]: Finished difference Result 2600 states and 4103 transitions. [2022-02-20 19:54:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4103 transitions. [2022-02-20 19:54:10,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:10,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:10,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:10,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 4102 transitions. [2022-02-20 19:54:11,021 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 4102 transitions. Word has length 106 [2022-02-20 19:54:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:11,022 INFO L470 AbstractCegarLoop]: Abstraction has 2598 states and 4102 transitions. [2022-02-20 19:54:11,022 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:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 4102 transitions. [2022-02-20 19:54:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:11,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:11,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:54:11,023 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1968354207, now seen corresponding path program 1 times [2022-02-20 19:54:11,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:11,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202680911] [2022-02-20 19:54:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:11,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {51856#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~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; {51856#true} is VALID [2022-02-20 19:54:11,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {51856#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; {51856#true} is VALID [2022-02-20 19:54:11,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {51856#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; {51856#true} is VALID [2022-02-20 19:54:11,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {51856#true} assume 0 == ~r1~0 % 256; {51856#true} is VALID [2022-02-20 19:54:11,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {51856#true} assume ~id1~0 >= 0; {51856#true} is VALID [2022-02-20 19:54:11,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {51856#true} assume 0 == ~st1~0; {51856#true} is VALID [2022-02-20 19:54:11,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {51856#true} assume ~send1~0 == ~id1~0; {51856#true} is VALID [2022-02-20 19:54:11,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {51856#true} assume 0 == ~mode1~0 % 256; {51856#true} is VALID [2022-02-20 19:54:11,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {51856#true} assume ~id2~0 >= 0; {51856#true} is VALID [2022-02-20 19:54:11,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {51856#true} assume 0 == ~st2~0; {51856#true} is VALID [2022-02-20 19:54:11,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {51856#true} assume ~send2~0 == ~id2~0; {51856#true} is VALID [2022-02-20 19:54:11,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {51856#true} assume 0 == ~mode2~0 % 256; {51856#true} is VALID [2022-02-20 19:54:11,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {51856#true} assume ~id3~0 >= 0; {51856#true} is VALID [2022-02-20 19:54:11,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {51856#true} assume 0 == ~st3~0; {51856#true} is VALID [2022-02-20 19:54:11,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {51856#true} assume ~send3~0 == ~id3~0; {51856#true} is VALID [2022-02-20 19:54:11,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {51856#true} assume 0 == ~mode3~0 % 256; {51856#true} is VALID [2022-02-20 19:54:11,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {51856#true} assume ~id4~0 >= 0; {51856#true} is VALID [2022-02-20 19:54:11,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {51856#true} assume 0 == ~st4~0; {51856#true} is VALID [2022-02-20 19:54:11,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {51856#true} assume ~send4~0 == ~id4~0; {51856#true} is VALID [2022-02-20 19:54:11,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {51856#true} assume 0 == ~mode4~0 % 256; {51856#true} is VALID [2022-02-20 19:54:11,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {51856#true} assume ~id5~0 >= 0; {51856#true} is VALID [2022-02-20 19:54:11,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {51856#true} assume 0 == ~st5~0; {51856#true} is VALID [2022-02-20 19:54:11,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {51856#true} assume ~send5~0 == ~id5~0; {51856#true} is VALID [2022-02-20 19:54:11,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {51856#true} assume 0 == ~mode5~0 % 256; {51856#true} is VALID [2022-02-20 19:54:11,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {51856#true} assume ~id6~0 >= 0; {51856#true} is VALID [2022-02-20 19:54:11,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {51856#true} assume 0 == ~st6~0; {51856#true} is VALID [2022-02-20 19:54:11,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {51856#true} assume ~send6~0 == ~id6~0; {51856#true} is VALID [2022-02-20 19:54:11,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {51856#true} assume 0 == ~mode6~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,131 INFO L290 TraceCheckUtils]: 53: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,132 INFO L290 TraceCheckUtils]: 55: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,132 INFO L290 TraceCheckUtils]: 56: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,135 INFO L290 TraceCheckUtils]: 63: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,136 INFO L290 TraceCheckUtils]: 64: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,136 INFO L290 TraceCheckUtils]: 65: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,137 INFO L290 TraceCheckUtils]: 67: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,141 INFO L290 TraceCheckUtils]: 75: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,142 INFO L290 TraceCheckUtils]: 78: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,143 INFO L290 TraceCheckUtils]: 80: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,143 INFO L290 TraceCheckUtils]: 81: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,145 INFO L290 TraceCheckUtils]: 84: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,145 INFO L290 TraceCheckUtils]: 85: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,146 INFO L290 TraceCheckUtils]: 86: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,146 INFO L290 TraceCheckUtils]: 87: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:54:11,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:54:11,147 INFO L290 TraceCheckUtils]: 90: Hoare triple {51857#false} assume !(node6_~m6~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:54:11,147 INFO L290 TraceCheckUtils]: 91: Hoare triple {51857#false} ~mode6~0 := 0; {51857#false} is VALID [2022-02-20 19:54:11,148 INFO L290 TraceCheckUtils]: 92: Hoare triple {51857#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; {51857#false} is VALID [2022-02-20 19:54:11,148 INFO L290 TraceCheckUtils]: 93: Hoare triple {51857#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:54:11,148 INFO L290 TraceCheckUtils]: 94: Hoare triple {51857#false} assume !(node7_~m7~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:54:11,148 INFO L290 TraceCheckUtils]: 95: Hoare triple {51857#false} ~mode7~0 := 0; {51857#false} is VALID [2022-02-20 19:54:11,148 INFO L290 TraceCheckUtils]: 96: Hoare triple {51857#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; {51857#false} is VALID [2022-02-20 19:54:11,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {51857#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:54:11,149 INFO L290 TraceCheckUtils]: 98: Hoare triple {51857#false} assume !(node8_~m8~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:54:11,149 INFO L290 TraceCheckUtils]: 99: Hoare triple {51857#false} ~mode8~0 := 0; {51857#false} is VALID [2022-02-20 19:54:11,149 INFO L290 TraceCheckUtils]: 100: Hoare triple {51857#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; {51857#false} is VALID [2022-02-20 19:54:11,149 INFO L290 TraceCheckUtils]: 101: Hoare triple {51857#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {51857#false} is VALID [2022-02-20 19:54:11,149 INFO L290 TraceCheckUtils]: 102: Hoare triple {51857#false} check_#res#1 := check_~tmp~1#1; {51857#false} is VALID [2022-02-20 19:54:11,149 INFO L290 TraceCheckUtils]: 103: Hoare triple {51857#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; {51857#false} is VALID [2022-02-20 19:54:11,149 INFO L290 TraceCheckUtils]: 104: Hoare triple {51857#false} assume 0 == assert_~arg#1 % 256; {51857#false} is VALID [2022-02-20 19:54:11,150 INFO L290 TraceCheckUtils]: 105: Hoare triple {51857#false} assume !false; {51857#false} is VALID [2022-02-20 19:54:11,150 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,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:11,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202680911] [2022-02-20 19:54:11,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202680911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:11,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:11,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:11,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990972099] [2022-02-20 19:54:11,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:11,152 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:11,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:11,152 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:11,227 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:11,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:11,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:11,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:11,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:11,229 INFO L87 Difference]: Start difference. First operand 2598 states and 4102 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:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:13,701 INFO L93 Difference]: Finished difference Result 4554 states and 7176 transitions. [2022-02-20 19:54:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:13,701 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:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:13,701 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:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:13,707 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:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:54:13,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:54:15,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.