./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.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.6.ufo.BOUNDED-12.pals+Problem12_label00.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 d9bb0fb3fb89b50a98609e7d92154455ef985195351d080b4795952eedc79161 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:46:34,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:46:34,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:46:34,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:46:34,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:46:34,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:46:34,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:46:34,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:46:34,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:46:34,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:46:34,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:46:34,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:46:34,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:46:34,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:46:34,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:46:34,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:46:34,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:46:34,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:46:34,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:46:34,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:46:34,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:46:34,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:46:34,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:46:34,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:46:34,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:46:34,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:46:34,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:46:34,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:46:34,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:46:34,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:46:34,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:46:34,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:46:34,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:46:34,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:46:34,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:46:34,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:46:34,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:46:34,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:46:34,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:46:34,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:46:34,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:46:34,634 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:46:34,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:46:34,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:46:34,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:46:34,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:46:34,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:46:34,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:46:34,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:46:34,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:46:34,667 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:46:34,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:46:34,668 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:46:34,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:46:34,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:46:34,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:46:34,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:46:34,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:46:34,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:46:34,669 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:46:34,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:46:34,669 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:46:34,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:46:34,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:46:34,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:46:34,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:46:34,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:46:34,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:46:34,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:46:34,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:46:34,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:46:34,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:46:34,672 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:46:34,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:46:34,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:46:34,673 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 -> d9bb0fb3fb89b50a98609e7d92154455ef985195351d080b4795952eedc79161 [2022-02-20 19:46:34,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:46:34,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:46:34,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:46:34,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:46:34,902 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:46:34,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2022-02-20 19:46:34,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0bbd7f3/c3e7250971454ee786908cb7e28c60fc/FLAG90433fe8a [2022-02-20 19:46:35,600 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:46:35,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2022-02-20 19:46:35,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0bbd7f3/c3e7250971454ee786908cb7e28c60fc/FLAG90433fe8a [2022-02-20 19:46:35,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0bbd7f3/c3e7250971454ee786908cb7e28c60fc [2022-02-20 19:46:35,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:46:35,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:46:35,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:46:35,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:46:35,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:46:35,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:46:35" (1/1) ... [2022-02-20 19:46:35,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727276aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:35, skipping insertion in model container [2022-02-20 19:46:35,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:46:35" (1/1) ... [2022-02-20 19:46:35,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:46:35,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:46:36,214 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[15482,15495] [2022-02-20 19:46:36,235 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[17357,17370] [2022-02-20 19:46:36,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:46:36,941 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:46:36,989 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[15482,15495] [2022-02-20 19:46:36,995 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[17357,17370] [2022-02-20 19:46:37,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:46:37,393 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:46:37,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37 WrapperNode [2022-02-20 19:46:37,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:46:37,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:46:37,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:46:37,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:46:37,401 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:46:37" (1/1) ... [2022-02-20 19:46:37,457 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:46:37" (1/1) ... [2022-02-20 19:46:37,916 INFO L137 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5149 [2022-02-20 19:46:37,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:46:37,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:46:37,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:46:37,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:46:37,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:37,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:38,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:38,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:38,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:38,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:38,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:38,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:46:38,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:46:38,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:46:38,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:46:38,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (1/1) ... [2022-02-20 19:46:38,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:46:38,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:46:38,433 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:46:38,455 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:46:38,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:46:38,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:46:38,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:46:38,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:46:38,614 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:46:38,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:46:46,684 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:46:46,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:46:46,704 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:46:46,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:46:46 BoogieIcfgContainer [2022-02-20 19:46:46,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:46:46,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:46:46,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:46:46,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:46:46,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:46:35" (1/3) ... [2022-02-20 19:46:46,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac35de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:46:46, skipping insertion in model container [2022-02-20 19:46:46,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:46:37" (2/3) ... [2022-02-20 19:46:46,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac35de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:46:46, skipping insertion in model container [2022-02-20 19:46:46,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:46:46" (3/3) ... [2022-02-20 19:46:46,721 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2022-02-20 19:46:46,726 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:46:46,726 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:46:46,779 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:46:46,789 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:46:46,790 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:46:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have 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:46:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 19:46:46,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:46,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:46:46,844 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash -442194987, now seen corresponding path program 1 times [2022-02-20 19:46:46,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:46,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289730712] [2022-02-20 19:46:46,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:46,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:47,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#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(33, 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;~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; {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {931#(<= 4 ~a5~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {931#(<= 4 ~a5~0)} assume !(0 != main_#t~nondet53#1);havoc main_#t~nondet53#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet51#1, main2_#t~ret52#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {931#(<= 4 ~a5~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet51#1 && main2_#t~nondet51#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet51#1;havoc main2_#t~nondet51#1; {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {931#(<= 4 ~a5~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~ret48#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {931#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {931#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {931#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {931#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {931#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {931#(<= 4 ~a5~0)} is VALID [2022-02-20 19:46:47,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {931#(<= 4 ~a5~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {930#false} is VALID [2022-02-20 19:46:47,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-02-20 19:46:47,061 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:46:47,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:47,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289730712] [2022-02-20 19:46:47,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289730712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:47,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:47,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:46:47,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297883257] [2022-02-20 19:46:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:47,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 19:46:47,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:47,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:46:47,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:47,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:46:47,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:46:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:46:47,113 INFO L87 Difference]: Start difference. First operand has 926 states, 923 states have (on average 1.8992416034669555) internal successors, (1753), 925 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:46:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:53,148 INFO L93 Difference]: Finished difference Result 2561 states and 4920 transitions. [2022-02-20 19:46:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:46:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-02-20 19:46:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:46:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:46:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4920 transitions. [2022-02-20 19:46:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:46:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4920 transitions. [2022-02-20 19:46:53,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4920 transitions. [2022-02-20 19:46:57,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4920 edges. 4920 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:57,355 INFO L225 Difference]: With dead ends: 2561 [2022-02-20 19:46:57,356 INFO L226 Difference]: Without dead ends: 1611 [2022-02-20 19:46:57,361 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:46:57,365 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 1066 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:46:57,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1066 Valid, 342 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-20 19:46:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-20 19:46:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-02-20 19:46:57,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:46:57,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:46:57,504 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:46:57,508 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:46:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:57,635 INFO L93 Difference]: Finished difference Result 1611 states and 2959 transitions. [2022-02-20 19:46:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2959 transitions. [2022-02-20 19:46:57,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:57,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:57,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:46:57,657 INFO L87 Difference]: Start difference. First operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:46:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:46:57,786 INFO L93 Difference]: Finished difference Result 1611 states and 2959 transitions. [2022-02-20 19:46:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2959 transitions. [2022-02-20 19:46:57,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:46:57,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:46:57,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:46:57,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:46:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1609 states have (on average 1.839030453697949) internal successors, (2959), 1610 states have internal predecessors, (2959), 0 states have call successors, (0), 0 states have 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:46:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2959 transitions. [2022-02-20 19:46:57,907 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2959 transitions. Word has length 16 [2022-02-20 19:46:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:46:57,908 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2959 transitions. [2022-02-20 19:46:57,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:46:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2959 transitions. [2022-02-20 19:46:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:46:57,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:46:57,909 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] [2022-02-20 19:46:57,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:46:57,910 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:46:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:46:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash 615382892, now seen corresponding path program 1 times [2022-02-20 19:46:57,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:46:57,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072227202] [2022-02-20 19:46:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:46:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:46:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:46:57,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {8387#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(33, 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;~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; {8387#true} is VALID [2022-02-20 19:46:57,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {8387#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {8387#true} is VALID [2022-02-20 19:46:57,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {8387#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8387#true} is VALID [2022-02-20 19:46:57,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {8387#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8389#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:46:57,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {8389#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8390#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:46:57,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {8390#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {8391#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:46:57,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {8391#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8388#false} is VALID [2022-02-20 19:46:57,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {8388#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;main1_~i2~0#1 := 0; {8388#false} is VALID [2022-02-20 19:46:57,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {8388#false} assume !!(main1_~i2~0#1 < 12);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; {8388#false} is VALID [2022-02-20 19:46:57,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {8388#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {8388#false} is VALID [2022-02-20 19:46:57,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {8388#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8388#false} is VALID [2022-02-20 19:46:57,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {8388#false} ~mode1~0 := 0; {8388#false} is VALID [2022-02-20 19:46:57,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:46:57,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {8388#false} assume !(0 != ~mode2~0 % 256); {8388#false} is VALID [2022-02-20 19:46:57,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {8388#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8388#false} is VALID [2022-02-20 19:46:57,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {8388#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {8388#false} is VALID [2022-02-20 19:46:57,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:46:57,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {8388#false} assume !(0 != ~mode3~0 % 256); {8388#false} is VALID [2022-02-20 19:46:57,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {8388#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8388#false} is VALID [2022-02-20 19:46:57,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {8388#false} ~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; {8388#false} is VALID [2022-02-20 19:46:57,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:46:57,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {8388#false} assume !(0 != ~mode4~0 % 256); {8388#false} is VALID [2022-02-20 19:46:57,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {8388#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {8388#false} is VALID [2022-02-20 19:46:57,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {8388#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {8388#false} is VALID [2022-02-20 19:46:57,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:46:57,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {8388#false} assume !(0 != ~mode5~0 % 256); {8388#false} is VALID [2022-02-20 19:46:57,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {8388#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {8388#false} is VALID [2022-02-20 19:46:57,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {8388#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {8388#false} is VALID [2022-02-20 19:46:58,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {8388#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; {8388#false} is VALID [2022-02-20 19:46:58,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {8388#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8388#false} is VALID [2022-02-20 19:46:58,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {8388#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8388#false} is VALID [2022-02-20 19:46:58,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {8388#false} ~mode6~0 := 0; {8388#false} is VALID [2022-02-20 19:46:58,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {8388#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8388#false} is VALID [2022-02-20 19:46:58,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {8388#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {8388#false} is VALID [2022-02-20 19:46:58,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {8388#false} check_#res#1 := check_~tmp~1#1; {8388#false} is VALID [2022-02-20 19:46:58,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {8388#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {8388#false} is VALID [2022-02-20 19:46:58,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {8388#false} assume 0 == assert_~arg#1 % 256; {8388#false} is VALID [2022-02-20 19:46:58,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {8388#false} assume !false; {8388#false} is VALID [2022-02-20 19:46:58,005 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:46:58,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:46:58,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072227202] [2022-02-20 19:46:58,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072227202] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:46:58,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:46:58,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:46:58,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079811991] [2022-02-20 19:46:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:46:58,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:46:58,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:46:58,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:46:58,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:46:58,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:46:58,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:46:58,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:46:58,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:46:58,045 INFO L87 Difference]: Start difference. First operand 1611 states and 2959 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:02,396 INFO L93 Difference]: Finished difference Result 1675 states and 3058 transitions. [2022-02-20 19:47:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:47:02,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:47:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1719 transitions. [2022-02-20 19:47:02,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1719 transitions. [2022-02-20 19:47:03,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:03,906 INFO L225 Difference]: With dead ends: 1675 [2022-02-20 19:47:03,907 INFO L226 Difference]: Without dead ends: 1611 [2022-02-20 19:47:03,907 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:47:03,908 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 3 mSDsluCounter, 4811 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6429 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:03,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6429 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-20 19:47:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-02-20 19:47:03,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:03,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:47:03,951 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:47:03,955 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:47:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:04,077 INFO L93 Difference]: Finished difference Result 1611 states and 2919 transitions. [2022-02-20 19:47:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2919 transitions. [2022-02-20 19:47:04,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:04,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:04,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:47:04,090 INFO L87 Difference]: Start difference. First operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 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 1611 states. [2022-02-20 19:47:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:04,210 INFO L93 Difference]: Finished difference Result 1611 states and 2919 transitions. [2022-02-20 19:47:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2919 transitions. [2022-02-20 19:47:04,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:04,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:04,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:04,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1609 states have (on average 1.8141702921068987) internal successors, (2919), 1610 states have internal predecessors, (2919), 0 states have call successors, (0), 0 states have 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:47:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2919 transitions. [2022-02-20 19:47:04,334 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2919 transitions. Word has length 38 [2022-02-20 19:47:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:04,335 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2919 transitions. [2022-02-20 19:47:04,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:47:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2919 transitions. [2022-02-20 19:47:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:04,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:04,337 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] [2022-02-20 19:47:04,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:47:04,337 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2101054792, now seen corresponding path program 1 times [2022-02-20 19:47:04,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:04,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057053797] [2022-02-20 19:47:04,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:04,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:04,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {14956#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(33, 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;~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; {14956#true} is VALID [2022-02-20 19:47:04,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {14956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {14956#true} is VALID [2022-02-20 19:47:04,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {14956#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14956#true} is VALID [2022-02-20 19:47:04,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {14956#true} assume 0 == ~r1~0; {14956#true} is VALID [2022-02-20 19:47:04,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {14956#true} assume ~id1~0 >= 0; {14956#true} is VALID [2022-02-20 19:47:04,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {14956#true} assume 0 == ~st1~0; {14956#true} is VALID [2022-02-20 19:47:04,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {14956#true} assume ~send1~0 == ~id1~0; {14956#true} is VALID [2022-02-20 19:47:04,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {14956#true} assume 0 == ~mode1~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:47:04,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {14958#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {14957#false} is VALID [2022-02-20 19:47:04,468 INFO L290 TraceCheckUtils]: 49: Hoare triple {14957#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14957#false} is VALID [2022-02-20 19:47:04,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {14957#false} ~mode1~0 := 0; {14957#false} is VALID [2022-02-20 19:47:04,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:04,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {14957#false} assume !(0 != ~mode2~0 % 256); {14957#false} is VALID [2022-02-20 19:47:04,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {14957#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14957#false} is VALID [2022-02-20 19:47:04,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {14957#false} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {14957#false} is VALID [2022-02-20 19:47:04,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:04,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {14957#false} assume !(0 != ~mode3~0 % 256); {14957#false} is VALID [2022-02-20 19:47:04,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {14957#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14957#false} is VALID [2022-02-20 19:47:04,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {14957#false} ~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; {14957#false} is VALID [2022-02-20 19:47:04,470 INFO L290 TraceCheckUtils]: 59: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:04,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {14957#false} assume !(0 != ~mode4~0 % 256); {14957#false} is VALID [2022-02-20 19:47:04,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {14957#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {14957#false} is VALID [2022-02-20 19:47:04,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {14957#false} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {14957#false} is VALID [2022-02-20 19:47:04,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:04,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {14957#false} assume !(0 != ~mode5~0 % 256); {14957#false} is VALID [2022-02-20 19:47:04,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {14957#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {14957#false} is VALID [2022-02-20 19:47:04,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {14957#false} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {14957#false} is VALID [2022-02-20 19:47:04,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {14957#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; {14957#false} is VALID [2022-02-20 19:47:04,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {14957#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {14957#false} is VALID [2022-02-20 19:47:04,480 INFO L290 TraceCheckUtils]: 69: Hoare triple {14957#false} assume !(node6_~m6~0#1 != ~nomsg~0); {14957#false} is VALID [2022-02-20 19:47:04,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {14957#false} ~mode6~0 := 0; {14957#false} is VALID [2022-02-20 19:47:04,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {14957#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14957#false} is VALID [2022-02-20 19:47:04,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {14957#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {14957#false} is VALID [2022-02-20 19:47:04,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {14957#false} check_#res#1 := check_~tmp~1#1; {14957#false} is VALID [2022-02-20 19:47:04,481 INFO L290 TraceCheckUtils]: 74: Hoare triple {14957#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {14957#false} is VALID [2022-02-20 19:47:04,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {14957#false} assume 0 == assert_~arg#1 % 256; {14957#false} is VALID [2022-02-20 19:47:04,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {14957#false} assume !false; {14957#false} is VALID [2022-02-20 19:47:04,482 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:47:04,482 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:04,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057053797] [2022-02-20 19:47:04,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057053797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:04,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:04,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:04,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055683112] [2022-02-20 19:47:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:04,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:04,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:04,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:04,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:04,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:04,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:04,534 INFO L87 Difference]: Start difference. First operand 1611 states and 2919 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:06,468 INFO L93 Difference]: Finished difference Result 1725 states and 3099 transitions. [2022-02-20 19:47:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:06,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:06,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:08,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:08,105 INFO L225 Difference]: With dead ends: 1725 [2022-02-20 19:47:08,105 INFO L226 Difference]: Without dead ends: 1665 [2022-02-20 19:47:08,106 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:47:08,107 INFO L933 BasicCegarLoop]: 1661 mSDtfsCounter, 1524 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1754 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:47:08,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1524 Valid, 1754 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2022-02-20 19:47:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1663. [2022-02-20 19:47:08,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:08,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:47:08,155 INFO L74 IsIncluded]: Start isIncluded. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:47:08,159 INFO L87 Difference]: Start difference. First operand 1665 states. Second operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:47:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:08,291 INFO L93 Difference]: Finished difference Result 1665 states and 3003 transitions. [2022-02-20 19:47:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3003 transitions. [2022-02-20 19:47:08,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:08,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:08,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 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 1665 states. [2022-02-20 19:47:08,302 INFO L87 Difference]: Start difference. First operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 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 1665 states. [2022-02-20 19:47:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:08,443 INFO L93 Difference]: Finished difference Result 1665 states and 3003 transitions. [2022-02-20 19:47:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3003 transitions. [2022-02-20 19:47:08,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:08,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:08,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:08,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1661 states have (on average 1.8073449729078868) internal successors, (3002), 1662 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have 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:47:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 3002 transitions. [2022-02-20 19:47:08,595 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 3002 transitions. Word has length 77 [2022-02-20 19:47:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:08,596 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 3002 transitions. [2022-02-20 19:47:08,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 3002 transitions. [2022-02-20 19:47:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:08,598 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:08,598 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] [2022-02-20 19:47:08,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:47:08,598 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1452480302, now seen corresponding path program 1 times [2022-02-20 19:47:08,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:08,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256064040] [2022-02-20 19:47:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:08,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {21746#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(33, 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;~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; {21746#true} is VALID [2022-02-20 19:47:08,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {21746#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {21746#true} is VALID [2022-02-20 19:47:08,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {21746#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21746#true} is VALID [2022-02-20 19:47:08,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {21746#true} assume 0 == ~r1~0; {21746#true} is VALID [2022-02-20 19:47:08,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {21746#true} assume ~id1~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:08,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {21746#true} assume 0 == ~st1~0; {21746#true} is VALID [2022-02-20 19:47:08,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {21746#true} assume ~send1~0 == ~id1~0; {21746#true} is VALID [2022-02-20 19:47:08,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {21746#true} assume 0 == ~mode1~0 % 256; {21746#true} is VALID [2022-02-20 19:47:08,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {21746#true} assume ~id2~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:08,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {21746#true} assume 0 == ~st2~0; {21746#true} is VALID [2022-02-20 19:47:08,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {21746#true} assume ~send2~0 == ~id2~0; {21746#true} is VALID [2022-02-20 19:47:08,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {21746#true} assume 0 == ~mode2~0 % 256; {21746#true} is VALID [2022-02-20 19:47:08,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {21746#true} assume ~id3~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:08,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {21746#true} assume 0 == ~st3~0; {21746#true} is VALID [2022-02-20 19:47:08,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {21746#true} assume ~send3~0 == ~id3~0; {21746#true} is VALID [2022-02-20 19:47:08,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {21746#true} assume 0 == ~mode3~0 % 256; {21746#true} is VALID [2022-02-20 19:47:08,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {21746#true} assume ~id4~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:08,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {21746#true} assume 0 == ~st4~0; {21746#true} is VALID [2022-02-20 19:47:08,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {21746#true} assume ~send4~0 == ~id4~0; {21746#true} is VALID [2022-02-20 19:47:08,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {21746#true} assume 0 == ~mode4~0 % 256; {21746#true} is VALID [2022-02-20 19:47:08,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {21746#true} assume ~id5~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:08,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {21746#true} assume 0 == ~st5~0; {21746#true} is VALID [2022-02-20 19:47:08,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {21746#true} assume ~send5~0 == ~id5~0; {21746#true} is VALID [2022-02-20 19:47:08,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {21746#true} assume 0 == ~mode5~0 % 256; {21746#true} is VALID [2022-02-20 19:47:08,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {21746#true} assume ~id6~0 >= 0; {21746#true} is VALID [2022-02-20 19:47:08,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {21746#true} assume 0 == ~st6~0; {21746#true} is VALID [2022-02-20 19:47:08,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {21746#true} assume ~send6~0 == ~id6~0; {21746#true} is VALID [2022-02-20 19:47:08,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {21746#true} assume 0 == ~mode6~0 % 256; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {21748#(= (+ (* (- 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;main1_~i2~0#1 := 0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,762 INFO L290 TraceCheckUtils]: 51: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,762 INFO L290 TraceCheckUtils]: 52: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {21748#(= (+ (* (- 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; {21748#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:47:08,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {21748#(= (+ (* (- 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; {21747#false} is VALID [2022-02-20 19:47:08,774 INFO L290 TraceCheckUtils]: 69: Hoare triple {21747#false} assume !(node6_~m6~0#1 != ~nomsg~0); {21747#false} is VALID [2022-02-20 19:47:08,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {21747#false} ~mode6~0 := 0; {21747#false} is VALID [2022-02-20 19:47:08,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {21747#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21747#false} is VALID [2022-02-20 19:47:08,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {21747#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {21747#false} is VALID [2022-02-20 19:47:08,778 INFO L290 TraceCheckUtils]: 73: Hoare triple {21747#false} check_#res#1 := check_~tmp~1#1; {21747#false} is VALID [2022-02-20 19:47:08,779 INFO L290 TraceCheckUtils]: 74: Hoare triple {21747#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {21747#false} is VALID [2022-02-20 19:47:08,779 INFO L290 TraceCheckUtils]: 75: Hoare triple {21747#false} assume 0 == assert_~arg#1 % 256; {21747#false} is VALID [2022-02-20 19:47:08,779 INFO L290 TraceCheckUtils]: 76: Hoare triple {21747#false} assume !false; {21747#false} is VALID [2022-02-20 19:47:08,781 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:47:08,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:08,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256064040] [2022-02-20 19:47:08,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256064040] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:08,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:08,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:08,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357713075] [2022-02-20 19:47:08,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:08,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:08,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:08,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:08,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:08,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:08,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:08,847 INFO L87 Difference]: Start difference. First operand 1663 states and 3002 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:10,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:10,712 INFO L93 Difference]: Finished difference Result 1875 states and 3338 transitions. [2022-02-20 19:47:10,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:10,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1760 transitions. [2022-02-20 19:47:10,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1760 transitions. [2022-02-20 19:47:12,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1760 edges. 1760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:12,342 INFO L225 Difference]: With dead ends: 1875 [2022-02-20 19:47:12,342 INFO L226 Difference]: Without dead ends: 1763 [2022-02-20 19:47:12,343 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:47:12,344 INFO L933 BasicCegarLoop]: 1604 mSDtfsCounter, 1504 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1717 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:47:12,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1504 Valid, 1717 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-02-20 19:47:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1761. [2022-02-20 19:47:12,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:12,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:47:12,404 INFO L74 IsIncluded]: Start isIncluded. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:47:12,406 INFO L87 Difference]: Start difference. First operand 1763 states. Second operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:47:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:12,542 INFO L93 Difference]: Finished difference Result 1763 states and 3158 transitions. [2022-02-20 19:47:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 3158 transitions. [2022-02-20 19:47:12,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:12,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:12,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 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 1763 states. [2022-02-20 19:47:12,551 INFO L87 Difference]: Start difference. First operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 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 1763 states. [2022-02-20 19:47:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:12,693 INFO L93 Difference]: Finished difference Result 1763 states and 3158 transitions. [2022-02-20 19:47:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 3158 transitions. [2022-02-20 19:47:12,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:12,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:12,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:12,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1759 states have (on average 1.794769755542922) internal successors, (3157), 1760 states have internal predecessors, (3157), 0 states have call successors, (0), 0 states have 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:47:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 3157 transitions. [2022-02-20 19:47:12,813 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 3157 transitions. Word has length 77 [2022-02-20 19:47:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:12,814 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 3157 transitions. [2022-02-20 19:47:12,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 3157 transitions. [2022-02-20 19:47:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:47:12,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:12,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:47:12,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:47:12,816 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1624501596, now seen corresponding path program 1 times [2022-02-20 19:47:12,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:12,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800217543] [2022-02-20 19:47:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:12,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {29025#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(33, 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;~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; {29025#true} is VALID [2022-02-20 19:47:12,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {29025#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {29025#true} is VALID [2022-02-20 19:47:12,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {29025#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29025#true} is VALID [2022-02-20 19:47:12,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {29025#true} assume 0 == ~r1~0; {29025#true} is VALID [2022-02-20 19:47:12,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {29025#true} assume ~id1~0 >= 0; {29025#true} is VALID [2022-02-20 19:47:12,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {29025#true} assume 0 == ~st1~0; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:12,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {29027#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:12,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {29027#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:12,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {29027#(<= ~st1~0 0)} assume ~id2~0 >= 0; {29027#(<= ~st1~0 0)} is VALID [2022-02-20 19:47:12,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {29027#(<= ~st1~0 0)} assume 0 == ~st2~0; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {29028#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {29028#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {29029#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {29030#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:47:12,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {29031#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,972 INFO L290 TraceCheckUtils]: 43: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,972 INFO L290 TraceCheckUtils]: 44: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(main1_~i2~0#1 < 12);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; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,984 INFO L290 TraceCheckUtils]: 66: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,984 INFO L290 TraceCheckUtils]: 67: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,985 INFO L290 TraceCheckUtils]: 68: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,985 INFO L290 TraceCheckUtils]: 69: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:47:12,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {29032#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {29026#false} is VALID [2022-02-20 19:47:12,987 INFO L290 TraceCheckUtils]: 73: Hoare triple {29026#false} check_#res#1 := check_~tmp~1#1; {29026#false} is VALID [2022-02-20 19:47:12,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {29026#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {29026#false} is VALID [2022-02-20 19:47:12,987 INFO L290 TraceCheckUtils]: 75: Hoare triple {29026#false} assume 0 == assert_~arg#1 % 256; {29026#false} is VALID [2022-02-20 19:47:12,987 INFO L290 TraceCheckUtils]: 76: Hoare triple {29026#false} assume !false; {29026#false} is VALID [2022-02-20 19:47:12,988 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:47:12,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:12,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800217543] [2022-02-20 19:47:12,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800217543] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:12,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:12,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:47:12,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133438491] [2022-02-20 19:47:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:12,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:12,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:12,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:13,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:13,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:47:13,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:47:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:47:13,040 INFO L87 Difference]: Start difference. First operand 1761 states and 3157 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:19,484 INFO L93 Difference]: Finished difference Result 4281 states and 7153 transitions. [2022-02-20 19:47:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 19:47:19,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:47:19,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:47:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2720 transitions. [2022-02-20 19:47:19,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 2720 transitions. [2022-02-20 19:47:21,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2720 edges. 2720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:22,229 INFO L225 Difference]: With dead ends: 4281 [2022-02-20 19:47:22,230 INFO L226 Difference]: Without dead ends: 4071 [2022-02-20 19:47:22,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:47:22,232 INFO L933 BasicCegarLoop]: 1574 mSDtfsCounter, 10491 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10491 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:22,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10491 Valid, 2765 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:47:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2022-02-20 19:47:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 1969. [2022-02-20 19:47:22,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:22,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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:47:22,557 INFO L74 IsIncluded]: Start isIncluded. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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:47:22,559 INFO L87 Difference]: Start difference. First operand 4071 states. Second operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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:47:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:23,042 INFO L93 Difference]: Finished difference Result 4071 states and 6772 transitions. [2022-02-20 19:47:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6772 transitions. [2022-02-20 19:47:23,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:23,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:23,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 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 4071 states. [2022-02-20 19:47:23,054 INFO L87 Difference]: Start difference. First operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 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 4071 states. [2022-02-20 19:47:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:23,530 INFO L93 Difference]: Finished difference Result 4071 states and 6772 transitions. [2022-02-20 19:47:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 6772 transitions. [2022-02-20 19:47:23,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:23,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:23,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:23,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1967 states have (on average 1.769700050838841) internal successors, (3481), 1968 states have internal predecessors, (3481), 0 states have call successors, (0), 0 states have 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:47:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3481 transitions. [2022-02-20 19:47:23,657 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3481 transitions. Word has length 77 [2022-02-20 19:47:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:23,657 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 3481 transitions. [2022-02-20 19:47:23,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have 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:47:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3481 transitions. [2022-02-20 19:47:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:47:23,658 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:23,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:47:23,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:47:23,658 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 806369108, now seen corresponding path program 1 times [2022-02-20 19:47:23,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:23,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753546138] [2022-02-20 19:47:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:23,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {44008#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(33, 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;~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; {44008#true} is VALID [2022-02-20 19:47:23,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {44008#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {44008#true} is VALID [2022-02-20 19:47:23,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {44008#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {44008#true} is VALID [2022-02-20 19:47:23,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {44008#true} assume 0 == ~r1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {44010#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {44010#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {44010#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {44010#(<= ~r1~0 0)} assume ~id4~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {44010#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {44010#(<= ~r1~0 0)} assume ~id5~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {44010#(<= ~r1~0 0)} assume ~send5~0 == ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode5~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {44010#(<= ~r1~0 0)} assume ~id6~0 >= 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~st6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {44010#(<= ~r1~0 0)} assume ~send6~0 == ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {44010#(<= ~r1~0 0)} assume 0 == ~mode6~0 % 256; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,754 INFO L290 TraceCheckUtils]: 29: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {44010#(<= ~r1~0 0)} assume ~id1~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {44010#(<= ~r1~0 0)} assume ~id2~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {44010#(<= ~r1~0 0)} assume ~id3~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {44010#(<= ~r1~0 0)} assume ~id4~0 != ~id5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,759 INFO L290 TraceCheckUtils]: 41: Hoare triple {44010#(<= ~r1~0 0)} assume ~id4~0 != ~id6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,759 INFO L290 TraceCheckUtils]: 42: Hoare triple {44010#(<= ~r1~0 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,759 INFO L290 TraceCheckUtils]: 43: Hoare triple {44010#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {44010#(<= ~r1~0 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {44010#(<= ~r1~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;main1_~i2~0#1 := 0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {44010#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 12);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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {44010#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,762 INFO L290 TraceCheckUtils]: 51: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {44010#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,764 INFO L290 TraceCheckUtils]: 55: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {44010#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,765 INFO L290 TraceCheckUtils]: 58: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {44010#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,766 INFO L290 TraceCheckUtils]: 62: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode5~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {44010#(<= ~r1~0 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,773 INFO L290 TraceCheckUtils]: 66: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {44010#(<= ~r1~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; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {44010#(<= ~r1~0 0)} assume !(0 != ~mode6~0 % 256); {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {44010#(<= ~r1~0 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {44010#(<= ~r1~0 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {44010#(<= ~r1~0 0)} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {44010#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {44010#(<= ~r1~0 0)} is VALID [2022-02-20 19:47:23,778 INFO L290 TraceCheckUtils]: 73: Hoare triple {44010#(<= ~r1~0 0)} assume ~r1~0 >= 6; {44009#false} is VALID [2022-02-20 19:47:23,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {44009#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {44009#false} is VALID [2022-02-20 19:47:23,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {44009#false} check_#res#1 := check_~tmp~1#1; {44009#false} is VALID [2022-02-20 19:47:23,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {44009#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {44009#false} is VALID [2022-02-20 19:47:23,778 INFO L290 TraceCheckUtils]: 77: Hoare triple {44009#false} assume 0 == assert_~arg#1 % 256; {44009#false} is VALID [2022-02-20 19:47:23,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {44009#false} assume !false; {44009#false} is VALID [2022-02-20 19:47:23,779 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:47:23,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:23,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753546138] [2022-02-20 19:47:23,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753546138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:23,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:23,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:47:23,780 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667356096] [2022-02-20 19:47:23,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 19:47:23,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:23,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:23,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:23,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:47:23,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:47:23,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:47:23,835 INFO L87 Difference]: Start difference. First operand 1969 states and 3481 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:25,735 INFO L93 Difference]: Finished difference Result 2589 states and 4453 transitions. [2022-02-20 19:47:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:47:25,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 19:47:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:47:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:47:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2022-02-20 19:47:25,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1761 transitions. [2022-02-20 19:47:27,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1761 edges. 1761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:27,201 INFO L225 Difference]: With dead ends: 2589 [2022-02-20 19:47:27,201 INFO L226 Difference]: Without dead ends: 2171 [2022-02-20 19:47:27,202 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:47:27,204 INFO L933 BasicCegarLoop]: 1585 mSDtfsCounter, 1496 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:47:27,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1496 Valid, 1675 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:47:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2022-02-20 19:47:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2022-02-20 19:47:27,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:47:27,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:27,623 INFO L74 IsIncluded]: Start isIncluded. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:27,625 INFO L87 Difference]: Start difference. First operand 2171 states. Second operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:27,816 INFO L93 Difference]: Finished difference Result 2171 states and 3790 transitions. [2022-02-20 19:47:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3790 transitions. [2022-02-20 19:47:27,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:27,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:27,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 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 2171 states. [2022-02-20 19:47:27,824 INFO L87 Difference]: Start difference. First operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 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 2171 states. [2022-02-20 19:47:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:47:28,009 INFO L93 Difference]: Finished difference Result 2171 states and 3790 transitions. [2022-02-20 19:47:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3790 transitions. [2022-02-20 19:47:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:47:28,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:47:28,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:47:28,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:47:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.7485002307337332) internal successors, (3789), 2168 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have 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:47:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3789 transitions. [2022-02-20 19:47:28,154 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3789 transitions. Word has length 79 [2022-02-20 19:47:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:47:28,154 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3789 transitions. [2022-02-20 19:47:28,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3789 transitions. [2022-02-20 19:47:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:47:28,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:47:28,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:47:28,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:47:28,155 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:47:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:47:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash 872862620, now seen corresponding path program 1 times [2022-02-20 19:47:28,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:47:28,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342969693] [2022-02-20 19:47:28,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:47:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:47:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:47:28,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {53421#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(33, 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;~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; {53421#true} is VALID [2022-02-20 19:47:28,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {53421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet53#1, main_#t~ret54#1, main_#t~ret55#1;assume -2147483648 <= main_#t~nondet53#1 && main_#t~nondet53#1 <= 2147483647; {53421#true} is VALID [2022-02-20 19:47:28,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {53421#true} assume 0 != main_#t~nondet53#1;havoc main_#t~nondet53#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_#t~post38#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {53421#true} is VALID [2022-02-20 19:47:28,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {53421#true} assume 0 == ~r1~0; {53421#true} is VALID [2022-02-20 19:47:28,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {53421#true} assume ~id1~0 >= 0; {53421#true} is VALID [2022-02-20 19:47:28,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {53421#true} assume 0 == ~st1~0; {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send1~0 == ~id1~0; {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode1~0 % 256; {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id2~0 >= 0; {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {53423#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st2~0; {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send2~0 == ~id2~0; {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode2~0 % 256; {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id3~0 >= 0; {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {53424#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st3~0; {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:47:28,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~send3~0 == ~id3~0; {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:47:28,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~mode3~0 % 256; {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:47:28,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~id4~0 >= 0; {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:47:28,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {53425#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~st4~0; {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send4~0 == ~id4~0; {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode4~0 % 256; {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id5~0 >= 0; {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {53426#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st5~0; {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send5~0 == ~id5~0; {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode5~0 % 256; {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id6~0 >= 0; {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 19:47:28,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {53427#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st6~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 == ~id6~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume 0 == ~mode6~0 % 256; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id2~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id3~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id4~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id5~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id6~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id3~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id4~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id5~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id6~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id4~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id5~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id6~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id5~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id6~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} init_#res#1 := init_~tmp~0#1; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#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; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !!(main1_~i2~0#1 < 12);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; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode1~0 % 256); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p1_new~0 := (if node1_#t~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; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode2~0 % 256); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p2_new~0 := (if node2_#t~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; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode3~0 % 256); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p3_new~0 := (if node3_#t~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; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode4~0 % 256); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p4_new~0 := (if node4_#t~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; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,450 INFO L290 TraceCheckUtils]: 64: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode5~0 % 256); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,450 INFO L290 TraceCheckUtils]: 65: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p5_new~0 := (if node5_#t~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; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,452 INFO L290 TraceCheckUtils]: 67: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,452 INFO L290 TraceCheckUtils]: 68: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode6~0 % 256); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(~r1~0 >= 6); {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 19:47:28,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {53428#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0);check_~tmp~1#1 := 0; {53422#false} is VALID [2022-02-20 19:47:28,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {53422#false} check_#res#1 := check_~tmp~1#1; {53422#false} is VALID [2022-02-20 19:47:28,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {53422#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#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; {53422#false} is VALID [2022-02-20 19:47:28,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {53422#false} assume 0 == assert_~arg#1 % 256; {53422#false} is VALID [2022-02-20 19:47:28,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {53422#false} assume !false; {53422#false} is VALID [2022-02-20 19:47:28,457 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:47:28,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:47:28,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342969693] [2022-02-20 19:47:28,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342969693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:47:28,458 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:47:28,458 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:47:28,458 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629529521] [2022-02-20 19:47:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:47:28,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-20 19:47:28,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:47:28,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:47:28,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:47:28,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:47:28,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:47:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:47:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:47:28,522 INFO L87 Difference]: Start difference. First operand 2169 states and 3789 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)