./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 d07f8866cb9bb11c792ba110404f1fc964b1e4b380540b8d73177141eae78bfc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:48:13,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:48:13,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:48:13,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:48:13,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:48:13,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:48:13,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:48:13,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:48:13,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:48:13,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:48:13,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:48:13,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:48:13,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:48:13,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:48:13,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:48:13,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:48:13,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:48:13,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:48:13,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:48:13,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:48:13,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:48:13,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:48:13,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:48:13,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:48:13,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:48:13,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:48:13,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:48:13,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:48:13,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:48:13,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:48:13,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:48:13,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:48:13,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:48:13,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:48:13,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:48:13,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:48:13,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:48:13,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:48:13,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:48:13,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:48:13,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:48:13,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:48:13,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:48:13,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:48:13,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:48:13,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:48:13,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:48:13,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:48:13,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:48:13,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:48:13,697 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:48:13,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:48:13,698 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:48:13,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:48:13,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:48:13,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:48:13,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:48:13,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:48:13,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:48:13,699 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:48:13,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:48:13,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:48:13,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:48:13,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:48:13,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:48:13,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:48:13,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:13,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:48:13,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:48:13,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:48:13,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:48:13,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:48:13,700 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:48:13,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:48:13,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:48:13,701 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 -> d07f8866cb9bb11c792ba110404f1fc964b1e4b380540b8d73177141eae78bfc [2022-02-20 18:48:13,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:48:13,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:48:13,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:48:13,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:48:13,953 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:48:13,954 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:48:14,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2fc2fc5/ef2354129f4b40df9cef80670b43da3b/FLAGb5bfa8ed8 [2022-02-20 18:48:14,406 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:48:14,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:48:14,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2fc2fc5/ef2354129f4b40df9cef80670b43da3b/FLAGb5bfa8ed8 [2022-02-20 18:48:14,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2fc2fc5/ef2354129f4b40df9cef80670b43da3b [2022-02-20 18:48:14,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:48:14,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:48:14,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:14,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:48:14,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:48:14,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@904b932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14, skipping insertion in model container [2022-02-20 18:48:14,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:48:14,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:48:14,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2022-02-20 18:48:14,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:14,696 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:48:14,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6358,6371] [2022-02-20 18:48:14,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:14,749 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:48:14,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14 WrapperNode [2022-02-20 18:48:14,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:14,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:14,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:48:14,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:48:14,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,805 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 507 [2022-02-20 18:48:14,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:14,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:48:14,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:48:14,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:48:14,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:48:14,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:48:14,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:48:14,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:48:14,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (1/1) ... [2022-02-20 18:48:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:14,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:48:14,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:48:14,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:48:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:48:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:48:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:48:14,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:48:14,998 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:48:14,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:48:15,539 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:48:15,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:48:15,546 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:48:15,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:15 BoogieIcfgContainer [2022-02-20 18:48:15,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:48:15,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:48:15,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:48:15,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:48:15,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:48:14" (1/3) ... [2022-02-20 18:48:15,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aead8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:15, skipping insertion in model container [2022-02-20 18:48:15,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:14" (2/3) ... [2022-02-20 18:48:15,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44aead8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:15, skipping insertion in model container [2022-02-20 18:48:15,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:15" (3/3) ... [2022-02-20 18:48:15,554 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:48:15,558 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:48:15,559 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:48:15,595 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:48:15,600 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:48:15,601 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:48:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 1.6946564885496183) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:48:15,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:15,632 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] [2022-02-20 18:48:15,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:15,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1416821255, now seen corresponding path program 1 times [2022-02-20 18:48:15,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:15,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540489552] [2022-02-20 18:48:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:15,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33314~0 := 0; {136#true} is VALID [2022-02-20 18:48:15,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {136#true} is VALID [2022-02-20 18:48:15,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume 0 == ~r1~0 % 256; {136#true} is VALID [2022-02-20 18:48:15,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {136#true} is VALID [2022-02-20 18:48:15,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {136#true} assume ~id1~0 >= 0; {136#true} is VALID [2022-02-20 18:48:15,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} assume 0 == ~st1~0; {136#true} is VALID [2022-02-20 18:48:15,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#true} assume ~send1~0 == ~id1~0; {136#true} is VALID [2022-02-20 18:48:15,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#true} assume 0 == ~mode1~0 % 256; {136#true} is VALID [2022-02-20 18:48:15,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#true} assume ~id2~0 >= 0; {136#true} is VALID [2022-02-20 18:48:15,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#true} assume 0 == ~st2~0; {136#true} is VALID [2022-02-20 18:48:15,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#true} assume ~send2~0 == ~id2~0; {136#true} is VALID [2022-02-20 18:48:15,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {136#true} assume 0 == ~mode2~0 % 256; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256); {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~alive1~0 % 256); {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:48:16,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {138#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {137#false} is VALID [2022-02-20 18:48:16,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {137#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {137#false} is VALID [2022-02-20 18:48:16,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {137#false} ~mode2~0 := 0; {137#false} is VALID [2022-02-20 18:48:16,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {137#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {137#false} is VALID [2022-02-20 18:48:16,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {137#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {137#false} is VALID [2022-02-20 18:48:16,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {137#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {137#false} is VALID [2022-02-20 18:48:16,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {137#false} ~mode3~0 := 0; {137#false} is VALID [2022-02-20 18:48:16,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {137#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {137#false} is VALID [2022-02-20 18:48:16,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {137#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {137#false} is VALID [2022-02-20 18:48:16,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {137#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {137#false} is VALID [2022-02-20 18:48:16,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {137#false} ~mode4~0 := 0; {137#false} is VALID [2022-02-20 18:48:16,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {137#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {137#false} is VALID [2022-02-20 18:48:16,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {137#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {137#false} is VALID [2022-02-20 18:48:16,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {137#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {137#false} is VALID [2022-02-20 18:48:16,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {137#false} ~mode5~0 := 0; {137#false} is VALID [2022-02-20 18:48:16,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {137#false} ~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;havoc main_~check__tmp~0#1; {137#false} is VALID [2022-02-20 18:48:16,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {137#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {137#false} is VALID [2022-02-20 18:48:16,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {137#false} ~__return_33314~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33314~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {137#false} is VALID [2022-02-20 18:48:16,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {137#false} assume 0 == main_~assert__arg~0#1 % 256; {137#false} is VALID [2022-02-20 18:48:16,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-02-20 18:48:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:16,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:16,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540489552] [2022-02-20 18:48:16,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540489552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:16,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:16,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:16,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643589435] [2022-02-20 18:48:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:48:16,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:16,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:16,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:16,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:16,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:16,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:16,113 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 1.6946564885496183) internal successors, (222), 132 states have internal predecessors, (222), 0 states have call successors, (0), 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 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:16,445 INFO L93 Difference]: Finished difference Result 313 states and 504 transitions. [2022-02-20 18:48:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:48:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-02-20 18:48:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-02-20 18:48:16,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 504 transitions. [2022-02-20 18:48:16,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 504 edges. 504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:16,813 INFO L225 Difference]: With dead ends: 313 [2022-02-20 18:48:16,813 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 18:48:16,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:16,817 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 160 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:16,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 471 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 18:48:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-02-20 18:48:16,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:16,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 206 states have (on average 1.5) internal successors, (309), 206 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,847 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 206 states have (on average 1.5) internal successors, (309), 206 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,848 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 206 states have (on average 1.5) internal successors, (309), 206 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:16,857 INFO L93 Difference]: Finished difference Result 209 states and 310 transitions. [2022-02-20 18:48:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2022-02-20 18:48:16,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:16,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:16,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 206 states have (on average 1.5) internal successors, (309), 206 states have internal predecessors, (309), 0 states have call successors, (0), 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 209 states. [2022-02-20 18:48:16,860 INFO L87 Difference]: Start difference. First operand has 207 states, 206 states have (on average 1.5) internal successors, (309), 206 states have internal predecessors, (309), 0 states have call successors, (0), 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 209 states. [2022-02-20 18:48:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:16,866 INFO L93 Difference]: Finished difference Result 209 states and 310 transitions. [2022-02-20 18:48:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 310 transitions. [2022-02-20 18:48:16,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:16,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:16,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:16,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.5) internal successors, (309), 206 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 309 transitions. [2022-02-20 18:48:16,875 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 309 transitions. Word has length 60 [2022-02-20 18:48:16,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:16,875 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 309 transitions. [2022-02-20 18:48:16,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 309 transitions. [2022-02-20 18:48:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:48:16,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:16,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:16,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:48:16,877 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash 20222822, now seen corresponding path program 1 times [2022-02-20 18:48:16,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:16,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143075228] [2022-02-20 18:48:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:16,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {1250#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33314~0 := 0; {1250#true} is VALID [2022-02-20 18:48:16,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {1250#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {1250#true} is VALID [2022-02-20 18:48:16,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1250#true} assume 0 == ~r1~0 % 256; {1250#true} is VALID [2022-02-20 18:48:16,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {1250#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1250#true} is VALID [2022-02-20 18:48:16,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {1250#true} assume ~id1~0 >= 0; {1250#true} is VALID [2022-02-20 18:48:16,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {1250#true} assume 0 == ~st1~0; {1250#true} is VALID [2022-02-20 18:48:16,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {1250#true} assume ~send1~0 == ~id1~0; {1250#true} is VALID [2022-02-20 18:48:16,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1250#true} assume 0 == ~mode1~0 % 256; {1250#true} is VALID [2022-02-20 18:48:16,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {1250#true} assume ~id2~0 >= 0; {1250#true} is VALID [2022-02-20 18:48:16,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {1250#true} assume 0 == ~st2~0; {1250#true} is VALID [2022-02-20 18:48:16,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {1250#true} assume ~send2~0 == ~id2~0; {1250#true} is VALID [2022-02-20 18:48:16,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {1250#true} assume 0 == ~mode2~0 % 256; {1250#true} is VALID [2022-02-20 18:48:16,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {1250#true} assume ~id3~0 >= 0; {1250#true} is VALID [2022-02-20 18:48:16,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {1250#true} assume 0 == ~st3~0; {1250#true} is VALID [2022-02-20 18:48:16,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {1250#true} assume ~send3~0 == ~id3~0; {1250#true} is VALID [2022-02-20 18:48:16,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {1250#true} assume 0 == ~mode3~0 % 256; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256); {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive1~0 % 256); {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256); {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~alive2~0 % 256); {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:48:16,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {1252#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1251#false} is VALID [2022-02-20 18:48:16,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {1251#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1251#false} is VALID [2022-02-20 18:48:16,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {1251#false} ~mode3~0 := 0; {1251#false} is VALID [2022-02-20 18:48:16,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {1251#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {1251#false} is VALID [2022-02-20 18:48:16,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {1251#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1251#false} is VALID [2022-02-20 18:48:16,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {1251#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {1251#false} is VALID [2022-02-20 18:48:16,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {1251#false} ~mode4~0 := 0; {1251#false} is VALID [2022-02-20 18:48:16,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {1251#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {1251#false} is VALID [2022-02-20 18:48:16,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {1251#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1251#false} is VALID [2022-02-20 18:48:16,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {1251#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {1251#false} is VALID [2022-02-20 18:48:16,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {1251#false} ~mode5~0 := 0; {1251#false} is VALID [2022-02-20 18:48:16,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {1251#false} ~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;havoc main_~check__tmp~0#1; {1251#false} is VALID [2022-02-20 18:48:16,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {1251#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {1251#false} is VALID [2022-02-20 18:48:16,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {1251#false} ~__return_33314~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33314~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1251#false} is VALID [2022-02-20 18:48:16,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {1251#false} assume 0 == main_~assert__arg~0#1 % 256; {1251#false} is VALID [2022-02-20 18:48:16,969 INFO L290 TraceCheckUtils]: 60: Hoare triple {1251#false} assume !false; {1251#false} is VALID [2022-02-20 18:48:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:16,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:16,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143075228] [2022-02-20 18:48:16,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143075228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:16,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:16,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:16,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301581999] [2022-02-20 18:48:16,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:16,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:48:16,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:16,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:17,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:17,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:17,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:17,007 INFO L87 Difference]: Start difference. First operand 207 states and 309 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:17,242 INFO L93 Difference]: Finished difference Result 519 states and 805 transitions. [2022-02-20 18:48:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 18:48:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-02-20 18:48:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-02-20 18:48:17,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 462 transitions. [2022-02-20 18:48:17,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:17,531 INFO L225 Difference]: With dead ends: 519 [2022-02-20 18:48:17,531 INFO L226 Difference]: Without dead ends: 347 [2022-02-20 18:48:17,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:17,533 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 130 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:17,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-02-20 18:48:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2022-02-20 18:48:17,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:17,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 345 states, 344 states have (on average 1.5348837209302326) internal successors, (528), 344 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,551 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 345 states, 344 states have (on average 1.5348837209302326) internal successors, (528), 344 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,551 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 345 states, 344 states have (on average 1.5348837209302326) internal successors, (528), 344 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:17,559 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-02-20 18:48:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 529 transitions. [2022-02-20 18:48:17,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:17,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:17,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 344 states have (on average 1.5348837209302326) internal successors, (528), 344 states have internal predecessors, (528), 0 states have call successors, (0), 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 347 states. [2022-02-20 18:48:17,561 INFO L87 Difference]: Start difference. First operand has 345 states, 344 states have (on average 1.5348837209302326) internal successors, (528), 344 states have internal predecessors, (528), 0 states have call successors, (0), 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 347 states. [2022-02-20 18:48:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:17,569 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-02-20 18:48:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 529 transitions. [2022-02-20 18:48:17,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:17,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:17,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:17,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.5348837209302326) internal successors, (528), 344 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 528 transitions. [2022-02-20 18:48:17,579 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 528 transitions. Word has length 61 [2022-02-20 18:48:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:17,580 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 528 transitions. [2022-02-20 18:48:17,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2022-02-20 18:48:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:48:17,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:17,581 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] [2022-02-20 18:48:17,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:48:17,582 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2012832692, now seen corresponding path program 1 times [2022-02-20 18:48:17,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:17,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562511810] [2022-02-20 18:48:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:17,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {3119#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33314~0 := 0; {3119#true} is VALID [2022-02-20 18:48:17,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {3119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {3119#true} is VALID [2022-02-20 18:48:17,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {3119#true} assume 0 == ~r1~0 % 256; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {3119#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {3119#true} assume ~id1~0 >= 0; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {3119#true} assume 0 == ~st1~0; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {3119#true} assume ~send1~0 == ~id1~0; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {3119#true} assume 0 == ~mode1~0 % 256; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {3119#true} assume ~id2~0 >= 0; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {3119#true} assume 0 == ~st2~0; {3119#true} is VALID [2022-02-20 18:48:17,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {3119#true} assume ~send2~0 == ~id2~0; {3119#true} is VALID [2022-02-20 18:48:17,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {3119#true} assume 0 == ~mode2~0 % 256; {3119#true} is VALID [2022-02-20 18:48:17,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {3119#true} assume ~id3~0 >= 0; {3119#true} is VALID [2022-02-20 18:48:17,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {3119#true} assume 0 == ~st3~0; {3119#true} is VALID [2022-02-20 18:48:17,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {3119#true} assume ~send3~0 == ~id3~0; {3119#true} is VALID [2022-02-20 18:48:17,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {3119#true} assume 0 == ~mode3~0 % 256; {3119#true} is VALID [2022-02-20 18:48:17,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {3119#true} assume ~id4~0 >= 0; {3119#true} is VALID [2022-02-20 18:48:17,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {3119#true} assume 0 == ~st4~0; {3119#true} is VALID [2022-02-20 18:48:17,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {3119#true} assume ~send4~0 == ~id4~0; {3119#true} is VALID [2022-02-20 18:48:17,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {3119#true} assume 0 == ~mode4~0 % 256; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode1~0 % 256); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive1~0 % 256); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode2~0 % 256); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive2~0 % 256); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~mode3~0 % 256); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(0 == ~alive3~0 % 256); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:48:17,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {3121#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3120#false} is VALID [2022-02-20 18:48:17,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {3120#false} assume !(main_~node4__m4~0#1 != ~nomsg~0); {3120#false} is VALID [2022-02-20 18:48:17,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {3120#false} ~mode4~0 := 0; {3120#false} is VALID [2022-02-20 18:48:17,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {3120#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3120#false} is VALID [2022-02-20 18:48:17,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {3120#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3120#false} is VALID [2022-02-20 18:48:17,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {3120#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {3120#false} is VALID [2022-02-20 18:48:17,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {3120#false} ~mode5~0 := 0; {3120#false} is VALID [2022-02-20 18:48:17,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {3120#false} ~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;havoc main_~check__tmp~0#1; {3120#false} is VALID [2022-02-20 18:48:17,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {3120#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {3120#false} is VALID [2022-02-20 18:48:17,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {3120#false} ~__return_33314~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33314~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3120#false} is VALID [2022-02-20 18:48:17,678 INFO L290 TraceCheckUtils]: 60: Hoare triple {3120#false} assume 0 == main_~assert__arg~0#1 % 256; {3120#false} is VALID [2022-02-20 18:48:17,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {3120#false} assume !false; {3120#false} is VALID [2022-02-20 18:48:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:17,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:17,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562511810] [2022-02-20 18:48:17,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562511810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:17,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:17,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:17,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953599447] [2022-02-20 18:48:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:17,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:48:17,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:17,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:17,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:17,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:17,717 INFO L87 Difference]: Start difference. First operand 345 states and 528 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:17,967 INFO L93 Difference]: Finished difference Result 901 states and 1410 transitions. [2022-02-20 18:48:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:17,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:48:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-02-20 18:48:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-02-20 18:48:17,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 462 transitions. [2022-02-20 18:48:18,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:18,213 INFO L225 Difference]: With dead ends: 901 [2022-02-20 18:48:18,214 INFO L226 Difference]: Without dead ends: 591 [2022-02-20 18:48:18,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:18,234 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 125 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:18,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 393 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-02-20 18:48:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2022-02-20 18:48:18,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:18,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5510204081632653) internal successors, (912), 588 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,284 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5510204081632653) internal successors, (912), 588 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,285 INFO L87 Difference]: Start difference. First operand 591 states. Second operand has 589 states, 588 states have (on average 1.5510204081632653) internal successors, (912), 588 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:18,339 INFO L93 Difference]: Finished difference Result 591 states and 913 transitions. [2022-02-20 18:48:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 913 transitions. [2022-02-20 18:48:18,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:18,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:18,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 589 states, 588 states have (on average 1.5510204081632653) internal successors, (912), 588 states have internal predecessors, (912), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:48:18,343 INFO L87 Difference]: Start difference. First operand has 589 states, 588 states have (on average 1.5510204081632653) internal successors, (912), 588 states have internal predecessors, (912), 0 states have call successors, (0), 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 591 states. [2022-02-20 18:48:18,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:18,358 INFO L93 Difference]: Finished difference Result 591 states and 913 transitions. [2022-02-20 18:48:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 913 transitions. [2022-02-20 18:48:18,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:18,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:18,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:18,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.5510204081632653) internal successors, (912), 588 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 912 transitions. [2022-02-20 18:48:18,390 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 912 transitions. Word has length 62 [2022-02-20 18:48:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:18,403 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 912 transitions. [2022-02-20 18:48:18,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 912 transitions. [2022-02-20 18:48:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:48:18,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:18,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:18,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:48:18,405 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 345107267, now seen corresponding path program 1 times [2022-02-20 18:48:18,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:18,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068759813] [2022-02-20 18:48:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:18,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {6348#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33314~0 := 0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {6348#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {6348#true} assume 0 == ~r1~0 % 256; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {6348#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 4: Hoare triple {6348#true} assume ~id1~0 >= 0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {6348#true} assume 0 == ~st1~0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {6348#true} assume ~send1~0 == ~id1~0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {6348#true} assume 0 == ~mode1~0 % 256; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {6348#true} assume ~id2~0 >= 0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {6348#true} assume 0 == ~st2~0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {6348#true} assume ~send2~0 == ~id2~0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {6348#true} assume 0 == ~mode2~0 % 256; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {6348#true} assume ~id3~0 >= 0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {6348#true} assume 0 == ~st3~0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {6348#true} assume ~send3~0 == ~id3~0; {6348#true} is VALID [2022-02-20 18:48:18,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {6348#true} assume 0 == ~mode3~0 % 256; {6348#true} is VALID [2022-02-20 18:48:18,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {6348#true} assume ~id4~0 >= 0; {6348#true} is VALID [2022-02-20 18:48:18,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {6348#true} assume 0 == ~st4~0; {6348#true} is VALID [2022-02-20 18:48:18,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {6348#true} assume ~send4~0 == ~id4~0; {6348#true} is VALID [2022-02-20 18:48:18,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {6348#true} assume 0 == ~mode4~0 % 256; {6348#true} is VALID [2022-02-20 18:48:18,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {6348#true} assume ~id5~0 >= 0; {6348#true} is VALID [2022-02-20 18:48:18,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {6348#true} assume 0 == ~st5~0; {6348#true} is VALID [2022-02-20 18:48:18,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {6348#true} assume ~send5~0 == ~id5~0; {6348#true} is VALID [2022-02-20 18:48:18,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {6348#true} assume 0 == ~mode5~0 % 256; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode1~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive1~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode2~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive2~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,500 INFO L290 TraceCheckUtils]: 43: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode3~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive3~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,502 INFO L290 TraceCheckUtils]: 50: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~mode4~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(0 == ~alive4~0 % 256); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:48:18,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {6350#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6349#false} is VALID [2022-02-20 18:48:18,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {6349#false} assume !(main_~node5__m5~0#1 != ~nomsg~0); {6349#false} is VALID [2022-02-20 18:48:18,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {6349#false} ~mode5~0 := 0; {6349#false} is VALID [2022-02-20 18:48:18,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {6349#false} ~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;havoc main_~check__tmp~0#1; {6349#false} is VALID [2022-02-20 18:48:18,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {6349#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {6349#false} is VALID [2022-02-20 18:48:18,508 INFO L290 TraceCheckUtils]: 60: Hoare triple {6349#false} ~__return_33314~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33314~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6349#false} is VALID [2022-02-20 18:48:18,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {6349#false} assume 0 == main_~assert__arg~0#1 % 256; {6349#false} is VALID [2022-02-20 18:48:18,509 INFO L290 TraceCheckUtils]: 62: Hoare triple {6349#false} assume !false; {6349#false} is VALID [2022-02-20 18:48:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:18,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:18,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068759813] [2022-02-20 18:48:18,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068759813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:18,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:18,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:48:18,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896825301] [2022-02-20 18:48:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:18,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:48:18,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:18,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:18,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:48:18,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:48:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:18,549 INFO L87 Difference]: Start difference. First operand 589 states and 912 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:18,865 INFO L93 Difference]: Finished difference Result 1569 states and 2458 transitions. [2022-02-20 18:48:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:48:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:48:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-02-20 18:48:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-02-20 18:48:18,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 462 transitions. [2022-02-20 18:48:19,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:19,192 INFO L225 Difference]: With dead ends: 1569 [2022-02-20 18:48:19,193 INFO L226 Difference]: Without dead ends: 1015 [2022-02-20 18:48:19,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:48:19,202 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 120 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:19,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 378 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:48:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2022-02-20 18:48:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1013. [2022-02-20 18:48:19,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:19,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1015 states. Second operand has 1013 states, 1012 states have (on average 1.5533596837944663) internal successors, (1572), 1012 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,240 INFO L74 IsIncluded]: Start isIncluded. First operand 1015 states. Second operand has 1013 states, 1012 states have (on average 1.5533596837944663) internal successors, (1572), 1012 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,243 INFO L87 Difference]: Start difference. First operand 1015 states. Second operand has 1013 states, 1012 states have (on average 1.5533596837944663) internal successors, (1572), 1012 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:19,277 INFO L93 Difference]: Finished difference Result 1015 states and 1573 transitions. [2022-02-20 18:48:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1573 transitions. [2022-02-20 18:48:19,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:19,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:19,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 1013 states, 1012 states have (on average 1.5533596837944663) internal successors, (1572), 1012 states have internal predecessors, (1572), 0 states have call successors, (0), 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 1015 states. [2022-02-20 18:48:19,281 INFO L87 Difference]: Start difference. First operand has 1013 states, 1012 states have (on average 1.5533596837944663) internal successors, (1572), 1012 states have internal predecessors, (1572), 0 states have call successors, (0), 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 1015 states. [2022-02-20 18:48:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:19,314 INFO L93 Difference]: Finished difference Result 1015 states and 1573 transitions. [2022-02-20 18:48:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1573 transitions. [2022-02-20 18:48:19,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:19,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:19,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:19,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.5533596837944663) internal successors, (1572), 1012 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1572 transitions. [2022-02-20 18:48:19,359 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1572 transitions. Word has length 63 [2022-02-20 18:48:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:19,359 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1572 transitions. [2022-02-20 18:48:19,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1572 transitions. [2022-02-20 18:48:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:48:19,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:19,361 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] [2022-02-20 18:48:19,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:48:19,361 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1868026547, now seen corresponding path program 1 times [2022-02-20 18:48:19,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:19,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613780832] [2022-02-20 18:48:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:19,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {11949#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33314~0 := 0; {11949#true} is VALID [2022-02-20 18:48:19,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {11949#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {11949#true} is VALID [2022-02-20 18:48:19,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {11949#true} assume 0 == ~r1~0 % 256; {11949#true} is VALID [2022-02-20 18:48:19,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {11949#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {11949#true} is VALID [2022-02-20 18:48:19,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {11949#true} assume ~id1~0 >= 0; {11949#true} is VALID [2022-02-20 18:48:19,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {11949#true} assume 0 == ~st1~0; {11951#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:19,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {11951#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {11951#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:19,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {11951#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {11951#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:19,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {11951#(<= ~st1~0 0)} assume ~id2~0 >= 0; {11951#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:19,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {11951#(<= ~st1~0 0)} assume 0 == ~st2~0; {11952#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {11952#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {11952#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {11952#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {11952#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {11952#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {11952#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {11952#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {11953#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {11954#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,470 INFO L290 TraceCheckUtils]: 47: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,472 INFO L290 TraceCheckUtils]: 53: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,472 INFO L290 TraceCheckUtils]: 55: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive5~0 % 256); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,473 INFO L290 TraceCheckUtils]: 57: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,473 INFO L290 TraceCheckUtils]: 58: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 1; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,473 INFO L290 TraceCheckUtils]: 59: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:19,474 INFO L290 TraceCheckUtils]: 60: Hoare triple {11955#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~0#1 := 0; {11950#false} is VALID [2022-02-20 18:48:19,474 INFO L290 TraceCheckUtils]: 61: Hoare triple {11950#false} ~__return_33314~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33314~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {11950#false} is VALID [2022-02-20 18:48:19,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {11950#false} assume 0 == main_~assert__arg~0#1 % 256; {11950#false} is VALID [2022-02-20 18:48:19,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {11950#false} assume !false; {11950#false} is VALID [2022-02-20 18:48:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:19,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:19,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613780832] [2022-02-20 18:48:19,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613780832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:19,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:19,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:48:19,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893806094] [2022-02-20 18:48:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:48:19,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:19,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:19,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:48:19,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:19,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:48:19,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:19,533 INFO L87 Difference]: Start difference. First operand 1013 states and 1572 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:25,501 INFO L93 Difference]: Finished difference Result 6881 states and 10794 transitions. [2022-02-20 18:48:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:48:25,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-02-20 18:48:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1092 transitions. [2022-02-20 18:48:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1092 transitions. [2022-02-20 18:48:25,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1092 transitions. [2022-02-20 18:48:26,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1092 edges. 1092 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:27,537 INFO L225 Difference]: With dead ends: 6881 [2022-02-20 18:48:27,537 INFO L226 Difference]: Without dead ends: 5903 [2022-02-20 18:48:27,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:48:27,541 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 1406 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:27,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1406 Valid, 2213 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2022-02-20 18:48:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 1989. [2022-02-20 18:48:29,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:29,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5903 states. Second operand has 1989 states, 1988 states have (on average 1.5472837022132797) internal successors, (3076), 1988 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:29,304 INFO L74 IsIncluded]: Start isIncluded. First operand 5903 states. Second operand has 1989 states, 1988 states have (on average 1.5472837022132797) internal successors, (3076), 1988 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:29,306 INFO L87 Difference]: Start difference. First operand 5903 states. Second operand has 1989 states, 1988 states have (on average 1.5472837022132797) internal successors, (3076), 1988 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:30,214 INFO L93 Difference]: Finished difference Result 5903 states and 9225 transitions. [2022-02-20 18:48:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5903 states and 9225 transitions. [2022-02-20 18:48:30,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:30,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:30,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 1989 states, 1988 states have (on average 1.5472837022132797) internal successors, (3076), 1988 states have internal predecessors, (3076), 0 states have call successors, (0), 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 5903 states. [2022-02-20 18:48:30,231 INFO L87 Difference]: Start difference. First operand has 1989 states, 1988 states have (on average 1.5472837022132797) internal successors, (3076), 1988 states have internal predecessors, (3076), 0 states have call successors, (0), 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 5903 states. [2022-02-20 18:48:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:31,142 INFO L93 Difference]: Finished difference Result 5903 states and 9225 transitions. [2022-02-20 18:48:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5903 states and 9225 transitions. [2022-02-20 18:48:31,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:31,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:31,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:31,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1988 states have (on average 1.5472837022132797) internal successors, (3076), 1988 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 3076 transitions. [2022-02-20 18:48:31,321 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 3076 transitions. Word has length 64 [2022-02-20 18:48:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:31,321 INFO L470 AbstractCegarLoop]: Abstraction has 1989 states and 3076 transitions. [2022-02-20 18:48:31,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 3076 transitions. [2022-02-20 18:48:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:48:31,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:31,322 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] [2022-02-20 18:48:31,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:48:31,323 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2054791872, now seen corresponding path program 1 times [2022-02-20 18:48:31,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:31,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162689441] [2022-02-20 18:48:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:31,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:31,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {36099#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33314~0 := 0; {36099#true} is VALID [2022-02-20 18:48:31,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {36099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {36099#true} is VALID [2022-02-20 18:48:31,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {36099#true} assume 0 == ~r1~0 % 256; {36099#true} is VALID [2022-02-20 18:48:31,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {36099#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,484 INFO L290 TraceCheckUtils]: 4: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,498 INFO L290 TraceCheckUtils]: 36: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:31,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {36101#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:31,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:31,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:31,502 INFO L290 TraceCheckUtils]: 40: Hoare triple {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:31,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {36102#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:31,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:31,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:31,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:31,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:31,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {36103#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:31,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:31,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1; {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:31,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:31,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:31,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {36104#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:31,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:31,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1; {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:31,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:31,509 INFO L290 TraceCheckUtils]: 55: Hoare triple {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~mode5~0 % 256); {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:31,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {36105#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~alive5~0 % 256); {36100#false} is VALID [2022-02-20 18:48:31,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {36100#false} assume !(~send5~0 != ~id5~0); {36100#false} is VALID [2022-02-20 18:48:31,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {36100#false} ~mode5~0 := 1; {36100#false} is VALID [2022-02-20 18:48:31,509 INFO L290 TraceCheckUtils]: 59: Hoare triple {36100#false} ~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;havoc main_~check__tmp~0#1; {36100#false} is VALID [2022-02-20 18:48:31,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {36100#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {36100#false} is VALID [2022-02-20 18:48:31,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {36100#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1; {36100#false} is VALID [2022-02-20 18:48:31,510 INFO L290 TraceCheckUtils]: 62: Hoare triple {36100#false} ~__return_33314~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33314~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {36100#false} is VALID [2022-02-20 18:48:31,510 INFO L290 TraceCheckUtils]: 63: Hoare triple {36100#false} assume 0 == main_~assert__arg~0#1 % 256; {36100#false} is VALID [2022-02-20 18:48:31,510 INFO L290 TraceCheckUtils]: 64: Hoare triple {36100#false} assume !false; {36100#false} is VALID [2022-02-20 18:48:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:31,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:31,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162689441] [2022-02-20 18:48:31,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162689441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:31,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:31,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:48:31,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534055086] [2022-02-20 18:48:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:31,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:48:31,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:31,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:31,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:31,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:48:31,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:31,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:48:31,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:31,564 INFO L87 Difference]: Start difference. First operand 1989 states and 3076 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:43,287 INFO L93 Difference]: Finished difference Result 10479 states and 16169 transitions. [2022-02-20 18:48:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:48:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-02-20 18:48:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2022-02-20 18:48:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2022-02-20 18:48:43,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 809 transitions. [2022-02-20 18:48:43,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 809 edges. 809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:46,677 INFO L225 Difference]: With dead ends: 10479 [2022-02-20 18:48:46,677 INFO L226 Difference]: Without dead ends: 8525 [2022-02-20 18:48:46,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:46,681 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 766 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:46,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 1072 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2022-02-20 18:48:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 8517. [2022-02-20 18:48:52,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:52,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8525 states. Second operand has 8517 states, 8516 states have (on average 1.5373414748708314) internal successors, (13092), 8516 states have internal predecessors, (13092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:52,603 INFO L74 IsIncluded]: Start isIncluded. First operand 8525 states. Second operand has 8517 states, 8516 states have (on average 1.5373414748708314) internal successors, (13092), 8516 states have internal predecessors, (13092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:52,617 INFO L87 Difference]: Start difference. First operand 8525 states. Second operand has 8517 states, 8516 states have (on average 1.5373414748708314) internal successors, (13092), 8516 states have internal predecessors, (13092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:54,649 INFO L93 Difference]: Finished difference Result 8525 states and 13096 transitions. [2022-02-20 18:48:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8525 states and 13096 transitions. [2022-02-20 18:48:54,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:54,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:54,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 8517 states, 8516 states have (on average 1.5373414748708314) internal successors, (13092), 8516 states have internal predecessors, (13092), 0 states have call successors, (0), 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 8525 states. [2022-02-20 18:48:54,678 INFO L87 Difference]: Start difference. First operand has 8517 states, 8516 states have (on average 1.5373414748708314) internal successors, (13092), 8516 states have internal predecessors, (13092), 0 states have call successors, (0), 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 8525 states. [2022-02-20 18:48:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:56,721 INFO L93 Difference]: Finished difference Result 8525 states and 13096 transitions. [2022-02-20 18:48:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8525 states and 13096 transitions. [2022-02-20 18:48:56,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:56,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:56,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:56,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8517 states, 8516 states have (on average 1.5373414748708314) internal successors, (13092), 8516 states have internal predecessors, (13092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8517 states to 8517 states and 13092 transitions. [2022-02-20 18:48:59,723 INFO L78 Accepts]: Start accepts. Automaton has 8517 states and 13092 transitions. Word has length 65 [2022-02-20 18:48:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:59,723 INFO L470 AbstractCegarLoop]: Abstraction has 8517 states and 13092 transitions. [2022-02-20 18:48:59,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 8517 states and 13092 transitions. [2022-02-20 18:48:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:48:59,725 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:59,725 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] [2022-02-20 18:48:59,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:48:59,726 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1554842583, now seen corresponding path program 1 times [2022-02-20 18:48:59,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:59,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130687830] [2022-02-20 18:48:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:59,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {79706#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(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33158~0 := 0;~__return_33314~0 := 0; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {79708#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:59,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {79708#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {79709#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:48:59,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {79709#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {79709#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:48:59,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {79709#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33158~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33158~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~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;main_~main__i2~0#1 := 0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {79710#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:59,807 INFO L290 TraceCheckUtils]: 42: Hoare triple {79710#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {79707#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {79707#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {79707#false} ~mode2~0 := 1; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {79707#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {79707#false} assume !!(0 == ~mode3~0 % 256); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {79707#false} assume !!(0 == ~alive3~0 % 256); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {79707#false} assume !(~send3~0 != ~id3~0); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {79707#false} ~mode3~0 := 1; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {79707#false} havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {79707#false} assume !!(0 == ~mode4~0 % 256); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {79707#false} assume !!(0 == ~alive4~0 % 256); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {79707#false} assume !(~send4~0 != ~id4~0); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {79707#false} ~mode4~0 := 1; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {79707#false} havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {79707#false} assume !!(0 == ~mode5~0 % 256); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {79707#false} assume !!(0 == ~alive5~0 % 256); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {79707#false} assume !(~send5~0 != ~id5~0); {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {79707#false} ~mode5~0 := 1; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {79707#false} ~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;havoc main_~check__tmp~0#1; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {79707#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {79707#false} is VALID [2022-02-20 18:48:59,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {79707#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1; {79707#false} is VALID [2022-02-20 18:48:59,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {79707#false} ~__return_33314~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33314~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {79707#false} is VALID [2022-02-20 18:48:59,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {79707#false} assume 0 == main_~assert__arg~0#1 % 256; {79707#false} is VALID [2022-02-20 18:48:59,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {79707#false} assume !false; {79707#false} is VALID [2022-02-20 18:48:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:59,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:59,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130687830] [2022-02-20 18:48:59,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130687830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:59,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:59,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:59,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847400144] [2022-02-20 18:48:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:59,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 18:48:59,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:59,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:59,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:59,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:59,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:59,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:59,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:59,848 INFO L87 Difference]: Start difference. First operand 8517 states and 13092 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)