./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-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 075767edbb592d061c1d85f41edb41733b674c2f33a2c1741ae50b9eba126551 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:51:35,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:51:35,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:51:35,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:51:35,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:51:35,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:51:35,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:51:35,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:51:35,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:51:35,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:51:35,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:51:35,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:51:35,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:51:35,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:51:35,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:51:35,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:51:35,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:51:35,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:51:35,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:51:35,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:51:35,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:51:35,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:51:35,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:51:35,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:51:35,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:51:35,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:51:35,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:51:35,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:51:35,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:51:35,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:51:35,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:51:35,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:51:35,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:51:35,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:51:35,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:51:35,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:51:35,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:51:35,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:51:35,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:51:35,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:51:35,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:51:35,742 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:51:35,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:51:35,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:51:35,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:51:35,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:51:35,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:51:35,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:51:35,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:51:35,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:51:35,768 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:51:35,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:51:35,768 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:51:35,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:51:35,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:51:35,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:51:35,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:51:35,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:51:35,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:51:35,770 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:51:35,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:51:35,770 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:51:35,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:51:35,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:51:35,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:51:35,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:51:35,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:35,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:51:35,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:51:35,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:51:35,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:51:35,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:51:35,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:51:35,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:51:35,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:51:35,772 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 -> 075767edbb592d061c1d85f41edb41733b674c2f33a2c1741ae50b9eba126551 [2022-02-20 18:51:35,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:51:36,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:51:36,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:51:36,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:51:36,008 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:51:36,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:51:36,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1672390ad/fc8b385e5873490cbce8eba0100e400c/FLAGc4a3766c1 [2022-02-20 18:51:36,483 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:51:36,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:51:36,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1672390ad/fc8b385e5873490cbce8eba0100e400c/FLAGc4a3766c1 [2022-02-20 18:51:36,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1672390ad/fc8b385e5873490cbce8eba0100e400c [2022-02-20 18:51:36,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:51:36,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:51:36,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:36,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:51:36,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:51:36,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36818691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36, skipping insertion in model container [2022-02-20 18:51:36,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:51:36,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:51:36,703 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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6780,6793] [2022-02-20 18:51:36,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:36,738 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:51:36,782 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.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[6780,6793] [2022-02-20 18:51:36,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:51:36,840 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:51:36,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36 WrapperNode [2022-02-20 18:51:36,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:51:36,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:36,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:51:36,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:51:36,849 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:51:36" (1/1) ... [2022-02-20 18:51:36,856 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:51:36" (1/1) ... [2022-02-20 18:51:36,898 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 529 [2022-02-20 18:51:36,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:51:36,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:51:36,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:51:36,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:51:36,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:51:36,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:51:36,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:51:36,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:51:36,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (1/1) ... [2022-02-20 18:51:36,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:51:36,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:51:36,982 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:51:36,998 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:51:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:51:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:51:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:51:37,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:51:37,145 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:51:37,147 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:51:37,703 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:51:37,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:51:37,714 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:51:37,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:37 BoogieIcfgContainer [2022-02-20 18:51:37,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:51:37,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:51:37,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:51:37,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:51:37,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:51:36" (1/3) ... [2022-02-20 18:51:37,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f4e327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:37, skipping insertion in model container [2022-02-20 18:51:37,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:51:36" (2/3) ... [2022-02-20 18:51:37,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f4e327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:51:37, skipping insertion in model container [2022-02-20 18:51:37,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:51:37" (3/3) ... [2022-02-20 18:51:37,721 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-02-20 18:51:37,724 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:51:37,724 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:51:37,753 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:51:37,757 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:51:37,757 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:51:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have 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:51:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:51:37,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:37,790 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:51:37,791 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1296157629, now seen corresponding path program 1 times [2022-02-20 18:51:37,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:37,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122627159] [2022-02-20 18:51:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:38,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {126#true} is VALID [2022-02-20 18:51:38,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {126#true} is VALID [2022-02-20 18:51:38,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} assume 0 == ~r1~0; {126#true} is VALID [2022-02-20 18:51:38,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#true} assume ~id1~0 >= 0; {126#true} is VALID [2022-02-20 18:51:38,137 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#true} assume 0 == ~st1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:38,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:38,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:38,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(<= ~st1~0 0)} assume ~id2~0 >= 0; {128#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:38,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(<= ~st1~0 0)} assume 0 == ~st2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {129#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {129#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {131#(<= (+ ~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;main_~main__i2~0#1 := 0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,164 INFO L290 TraceCheckUtils]: 40: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,164 INFO L290 TraceCheckUtils]: 41: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,170 INFO L290 TraceCheckUtils]: 43: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,177 INFO L290 TraceCheckUtils]: 52: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:38,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {131#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {127#false} is VALID [2022-02-20 18:51:38,180 INFO L290 TraceCheckUtils]: 59: Hoare triple {127#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {127#false} is VALID [2022-02-20 18:51:38,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {127#false} assume 0 == main_~assert__arg~1#1 % 256; {127#false} is VALID [2022-02-20 18:51:38,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {127#false} assume !false; {127#false} is VALID [2022-02-20 18:51:38,183 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:51:38,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:38,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122627159] [2022-02-20 18:51:38,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122627159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:38,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:38,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:38,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66821257] [2022-02-20 18:51:38,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:38,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:51:38,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:38,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:51:38,251 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:51:38,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:38,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:38,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:38,275 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.7520661157024793) internal successors, (212), 122 states have internal predecessors, (212), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:51:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:39,643 INFO L93 Difference]: Finished difference Result 589 states and 942 transitions. [2022-02-20 18:51:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:51:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:51:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:51:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2022-02-20 18:51:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:51:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 942 transitions. [2022-02-20 18:51:39,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 942 transitions. [2022-02-20 18:51:40,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 942 edges. 942 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:40,333 INFO L225 Difference]: With dead ends: 589 [2022-02-20 18:51:40,333 INFO L226 Difference]: Without dead ends: 511 [2022-02-20 18:51:40,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:51:40,351 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 910 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:40,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 1605 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-02-20 18:51:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 185. [2022-02-20 18:51:40,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:40,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have 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:51:40,453 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have 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:51:40,454 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have 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:51:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:40,473 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2022-02-20 18:51:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 769 transitions. [2022-02-20 18:51:40,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:40,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:40,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:51:40,478 INFO L87 Difference]: Start difference. First operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 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 511 states. [2022-02-20 18:51:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:40,496 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2022-02-20 18:51:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 769 transitions. [2022-02-20 18:51:40,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:40,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:40,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:40,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.451086956521739) internal successors, (267), 184 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have 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:51:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2022-02-20 18:51:40,505 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 62 [2022-02-20 18:51:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:40,506 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2022-02-20 18:51:40,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:51:40,506 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2022-02-20 18:51:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:40,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:40,509 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:51:40,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:51:40,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash -574954446, now seen corresponding path program 1 times [2022-02-20 18:51:40,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:40,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373113958] [2022-02-20 18:51:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:40,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {2189#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {2189#true} is VALID [2022-02-20 18:51:40,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {2189#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {2189#true} is VALID [2022-02-20 18:51:40,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {2189#true} assume 0 == ~r1~0; {2189#true} is VALID [2022-02-20 18:51:40,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {2189#true} assume ~id1~0 >= 0; {2189#true} is VALID [2022-02-20 18:51:40,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {2189#true} assume 0 == ~st1~0; {2189#true} is VALID [2022-02-20 18:51:40,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {2189#true} assume ~send1~0 == ~id1~0; {2189#true} is VALID [2022-02-20 18:51:40,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {2189#true} assume 0 == ~mode1~0 % 256; {2189#true} is VALID [2022-02-20 18:51:40,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {2189#true} assume ~id2~0 >= 0; {2189#true} is VALID [2022-02-20 18:51:40,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2189#true} assume 0 == ~st2~0; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:40,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {2191#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:40,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {2191#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:40,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {2191#(<= ~st2~0 0)} assume ~id3~0 >= 0; {2191#(<= ~st2~0 0)} is VALID [2022-02-20 18:51:40,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {2191#(<= ~st2~0 0)} assume 0 == ~st3~0; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id4~0 >= 0; {2192#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {2192#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~send4~0 == ~id4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~mode4~0 % 256; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~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;main_~main__i2~0#1 := 0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 4); {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:51:40,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {2193#(<= (+ ~st4~0 ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,668 INFO L290 TraceCheckUtils]: 50: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,668 INFO L290 TraceCheckUtils]: 51: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:51:40,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {2194#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st4~0 ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {2190#false} is VALID [2022-02-20 18:51:40,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {2190#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {2190#false} is VALID [2022-02-20 18:51:40,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {2190#false} assume 0 == main_~assert__arg~1#1 % 256; {2190#false} is VALID [2022-02-20 18:51:40,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {2190#false} assume !false; {2190#false} is VALID [2022-02-20 18:51:40,689 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:51:40,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:40,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373113958] [2022-02-20 18:51:40,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373113958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:40,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:40,690 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:40,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63333271] [2022-02-20 18:51:40,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:40,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:40,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:40,726 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:51:40,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:40,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:40,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:40,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:40,727 INFO L87 Difference]: Start difference. First operand 185 states and 267 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:41,744 INFO L93 Difference]: Finished difference Result 654 states and 1000 transitions. [2022-02-20 18:51:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:51:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:51:41,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 615 transitions. [2022-02-20 18:51:42,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:42,164 INFO L225 Difference]: With dead ends: 654 [2022-02-20 18:51:42,165 INFO L226 Difference]: Without dead ends: 554 [2022-02-20 18:51:42,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:42,166 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 520 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:42,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 1030 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-02-20 18:51:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 294. [2022-02-20 18:51:42,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:42,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:51:42,364 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:51:42,365 INFO L87 Difference]: Start difference. First operand 554 states. Second operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:51:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:42,379 INFO L93 Difference]: Finished difference Result 554 states and 842 transitions. [2022-02-20 18:51:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 842 transitions. [2022-02-20 18:51:42,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:42,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:42,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 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 554 states. [2022-02-20 18:51:42,382 INFO L87 Difference]: Start difference. First operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 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 554 states. [2022-02-20 18:51:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:42,395 INFO L93 Difference]: Finished difference Result 554 states and 842 transitions. [2022-02-20 18:51:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 842 transitions. [2022-02-20 18:51:42,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:42,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:42,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:42,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.4982935153583619) internal successors, (439), 293 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:51:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2022-02-20 18:51:42,403 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 64 [2022-02-20 18:51:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:42,403 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2022-02-20 18:51:42,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2022-02-20 18:51:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:42,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:42,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, 1] [2022-02-20 18:51:42,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:51:42,405 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash -254559290, now seen corresponding path program 1 times [2022-02-20 18:51:42,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:42,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945770309] [2022-02-20 18:51:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:42,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {4578#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {4578#true} is VALID [2022-02-20 18:51:42,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {4578#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {4578#true} is VALID [2022-02-20 18:51:42,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {4578#true} assume 0 == ~r1~0; {4578#true} is VALID [2022-02-20 18:51:42,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {4578#true} assume ~id1~0 >= 0; {4578#true} is VALID [2022-02-20 18:51:42,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {4578#true} assume 0 == ~st1~0; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:42,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {4580#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:42,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {4580#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:42,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {4580#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4580#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:42,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {4580#(<= ~st1~0 0)} assume 0 == ~st2~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {4581#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {4581#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {4582#(<= (+ ~st4~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;main_~main__i2~0#1 := 0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,543 INFO L290 TraceCheckUtils]: 51: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:42,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {4582#(<= (+ ~st4~0 ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:42,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:42,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:42,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:42,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:42,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:42,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {4583#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st4~0 ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {4579#false} is VALID [2022-02-20 18:51:42,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {4579#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {4579#false} is VALID [2022-02-20 18:51:42,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {4579#false} assume 0 == main_~assert__arg~1#1 % 256; {4579#false} is VALID [2022-02-20 18:51:42,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {4579#false} assume !false; {4579#false} is VALID [2022-02-20 18:51:42,550 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:51:42,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:42,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945770309] [2022-02-20 18:51:42,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945770309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:42,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:42,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:42,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987937491] [2022-02-20 18:51:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:42,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:42,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:42,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:42,596 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:51:42,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:42,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:42,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:42,597 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:43,645 INFO L93 Difference]: Finished difference Result 763 states and 1172 transitions. [2022-02-20 18:51:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:43,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:51:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:51:43,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 615 transitions. [2022-02-20 18:51:44,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:44,028 INFO L225 Difference]: With dead ends: 763 [2022-02-20 18:51:44,028 INFO L226 Difference]: Without dead ends: 663 [2022-02-20 18:51:44,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:44,029 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 600 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:44,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 792 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-02-20 18:51:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 447. [2022-02-20 18:51:44,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:44,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 663 states. Second operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:51:44,346 INFO L74 IsIncluded]: Start isIncluded. First operand 663 states. Second operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:51:44,347 INFO L87 Difference]: Start difference. First operand 663 states. Second operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:51:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,362 INFO L93 Difference]: Finished difference Result 663 states and 1014 transitions. [2022-02-20 18:51:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1014 transitions. [2022-02-20 18:51:44,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:51:44,365 INFO L87 Difference]: Start difference. First operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 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 663 states. [2022-02-20 18:51:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,379 INFO L93 Difference]: Finished difference Result 663 states and 1014 transitions. [2022-02-20 18:51:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1014 transitions. [2022-02-20 18:51:44,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:44,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.5246636771300448) internal successors, (680), 446 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have 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:51:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 680 transitions. [2022-02-20 18:51:44,390 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 680 transitions. Word has length 64 [2022-02-20 18:51:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:44,391 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 680 transitions. [2022-02-20 18:51:44,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 680 transitions. [2022-02-20 18:51:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:44,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:44,392 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:51:44,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:51:44,393 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:44,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1989488918, now seen corresponding path program 1 times [2022-02-20 18:51:44,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:44,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863283647] [2022-02-20 18:51:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {7547#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {7547#true} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {7547#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {7547#true} is VALID [2022-02-20 18:51:44,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {7547#true} assume 0 == ~r1~0; {7547#true} is VALID [2022-02-20 18:51:44,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {7547#true} assume ~id1~0 >= 0; {7547#true} is VALID [2022-02-20 18:51:44,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {7547#true} assume 0 == ~st1~0; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {7549#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {7549#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {7549#(<= ~st1~0 0)} assume ~id2~0 >= 0; {7549#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:44,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {7549#(<= ~st1~0 0)} assume 0 == ~st2~0; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {7550#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {7550#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {7551#(<= (+ ~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;main_~main__i2~0#1 := 0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 != ~nomsg~0; {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 > ~id4~0); {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:44,520 INFO L290 TraceCheckUtils]: 57: Hoare triple {7551#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~node4__m4~1#1 == ~id4~0;~st4~0 := 1; {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:51:44,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:51:44,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} is VALID [2022-02-20 18:51:44,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {7552#(and (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= (+ (- 1) ~st4~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {7548#false} is VALID [2022-02-20 18:51:44,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {7548#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {7548#false} is VALID [2022-02-20 18:51:44,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {7548#false} assume 0 == main_~assert__arg~1#1 % 256; {7548#false} is VALID [2022-02-20 18:51:44,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {7548#false} assume !false; {7548#false} is VALID [2022-02-20 18:51:44,523 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:51:44,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:44,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863283647] [2022-02-20 18:51:44,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863283647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:44,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:44,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:44,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340180659] [2022-02-20 18:51:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:44,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:44,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:44,562 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:51:44,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:44,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:44,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:44,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:44,563 INFO L87 Difference]: Start difference. First operand 447 states and 680 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:45,650 INFO L93 Difference]: Finished difference Result 862 states and 1328 transitions. [2022-02-20 18:51:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:45,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:51:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2022-02-20 18:51:45,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 615 transitions. [2022-02-20 18:51:46,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:46,033 INFO L225 Difference]: With dead ends: 862 [2022-02-20 18:51:46,033 INFO L226 Difference]: Without dead ends: 762 [2022-02-20 18:51:46,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:46,034 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 677 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:46,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [677 Valid, 780 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-02-20 18:51:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 546. [2022-02-20 18:51:46,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:46,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 762 states. Second operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:51:46,425 INFO L74 IsIncluded]: Start isIncluded. First operand 762 states. Second operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:51:46,427 INFO L87 Difference]: Start difference. First operand 762 states. Second operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:51:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,455 INFO L93 Difference]: Finished difference Result 762 states and 1170 transitions. [2022-02-20 18:51:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1170 transitions. [2022-02-20 18:51:46,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:46,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:46,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 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 762 states. [2022-02-20 18:51:46,463 INFO L87 Difference]: Start difference. First operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 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 762 states. [2022-02-20 18:51:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:46,482 INFO L93 Difference]: Finished difference Result 762 states and 1170 transitions. [2022-02-20 18:51:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1170 transitions. [2022-02-20 18:51:46,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:46,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:46,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:46,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.5339449541284405) internal successors, (836), 545 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have 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:51:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 836 transitions. [2022-02-20 18:51:46,500 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 836 transitions. Word has length 64 [2022-02-20 18:51:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:46,501 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 836 transitions. [2022-02-20 18:51:46,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 836 transitions. [2022-02-20 18:51:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:46,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:46,502 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:51:46,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:51:46,503 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1188595012, now seen corresponding path program 1 times [2022-02-20 18:51:46,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:46,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963137615] [2022-02-20 18:51:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:46,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {10990#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {10990#true} is VALID [2022-02-20 18:51:46,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {10990#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {10990#true} is VALID [2022-02-20 18:51:46,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {10990#true} assume 0 == ~r1~0; {10990#true} is VALID [2022-02-20 18:51:46,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {10990#true} assume ~id1~0 >= 0; {10990#true} is VALID [2022-02-20 18:51:46,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {10990#true} assume 0 == ~st1~0; {10990#true} is VALID [2022-02-20 18:51:46,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {10990#true} assume ~send1~0 == ~id1~0; {10990#true} is VALID [2022-02-20 18:51:46,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {10990#true} assume 0 == ~mode1~0 % 256; {10990#true} is VALID [2022-02-20 18:51:46,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {10990#true} assume ~id2~0 >= 0; {10990#true} is VALID [2022-02-20 18:51:46,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {10990#true} assume 0 == ~st2~0; {10990#true} is VALID [2022-02-20 18:51:46,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {10990#true} assume ~send2~0 == ~id2~0; {10990#true} is VALID [2022-02-20 18:51:46,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {10990#true} assume 0 == ~mode2~0 % 256; {10990#true} is VALID [2022-02-20 18:51:46,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {10990#true} assume ~id3~0 >= 0; {10990#true} is VALID [2022-02-20 18:51:46,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {10990#true} assume 0 == ~st3~0; {10990#true} is VALID [2022-02-20 18:51:46,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {10990#true} assume ~send3~0 == ~id3~0; {10990#true} is VALID [2022-02-20 18:51:46,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {10990#true} assume 0 == ~mode3~0 % 256; {10990#true} is VALID [2022-02-20 18:51:46,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {10990#true} assume ~id4~0 >= 0; {10990#true} is VALID [2022-02-20 18:51:46,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {10990#true} assume 0 == ~st4~0; {10990#true} is VALID [2022-02-20 18:51:46,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {10990#true} assume ~send4~0 == ~id4~0; {10990#true} is VALID [2022-02-20 18:51:46,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {10990#true} assume 0 == ~mode4~0 % 256; {10990#true} is VALID [2022-02-20 18:51:46,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {10990#true} assume ~id1~0 != ~id2~0; {10990#true} is VALID [2022-02-20 18:51:46,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {10990#true} assume ~id1~0 != ~id3~0; {10990#true} is VALID [2022-02-20 18:51:46,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {10990#true} assume ~id1~0 != ~id4~0; {10990#true} is VALID [2022-02-20 18:51:46,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {10990#true} assume ~id2~0 != ~id3~0; {10990#true} is VALID [2022-02-20 18:51:46,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {10990#true} assume ~id2~0 != ~id4~0; {10990#true} is VALID [2022-02-20 18:51:46,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {10990#true} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {10990#true} is VALID [2022-02-20 18:51:46,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {10990#true} 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;main_~main__i2~0#1 := 0; {10990#true} is VALID [2022-02-20 18:51:46,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {10990#true} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {10990#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:51:46,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {10990#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {10990#true} is VALID [2022-02-20 18:51:46,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {10990#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {10990#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:51:46,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {10990#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {10990#true} is VALID [2022-02-20 18:51:46,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {10990#true} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {10990#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:51:46,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {10990#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {10990#true} is VALID [2022-02-20 18:51:46,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {10990#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {10990#true} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:51:46,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {10990#true} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {10990#true} is VALID [2022-02-20 18:51:46,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {10990#true} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {10990#true} is VALID [2022-02-20 18:51:46,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {10990#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {10990#true} is VALID [2022-02-20 18:51:46,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {10990#true} assume !(~r1~0 >= 4); {10990#true} is VALID [2022-02-20 18:51:46,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {10990#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {10990#true} is VALID [2022-02-20 18:51:46,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {10990#true} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {10990#true} is VALID [2022-02-20 18:51:46,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {10990#true} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {10990#true} is VALID [2022-02-20 18:51:46,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {10990#true} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {10990#true} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {10990#true} assume !(main_~node1__m1~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:51:46,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {10990#true} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {10990#true} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {10990#true} assume !(main_~node2__m2~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:51:46,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {10990#true} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {10990#true} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {10990#true} assume !(main_~node3__m3~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:51:46,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {10990#true} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {10990#true} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {10990#true} is VALID [2022-02-20 18:51:46,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {10990#true} assume !(main_~node4__m4~1#1 != ~nomsg~0); {10990#true} is VALID [2022-02-20 18:51:46,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {10990#true} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {10990#true} is VALID [2022-02-20 18:51:46,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {10990#true} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {10990#true} is VALID [2022-02-20 18:51:46,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {10990#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {10990#true} is VALID [2022-02-20 18:51:46,583 INFO L290 TraceCheckUtils]: 59: Hoare triple {10990#true} assume ~r1~0 >= 4; {10992#(not (<= ~r1~0 3))} is VALID [2022-02-20 18:51:46,583 INFO L290 TraceCheckUtils]: 60: Hoare triple {10992#(not (<= ~r1~0 3))} assume ~r1~0 < 4;main_~check__tmp~1#1 := 1; {10991#false} is VALID [2022-02-20 18:51:46,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {10991#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {10991#false} is VALID [2022-02-20 18:51:46,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {10991#false} assume 0 == main_~assert__arg~1#1 % 256; {10991#false} is VALID [2022-02-20 18:51:46,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {10991#false} assume !false; {10991#false} is VALID [2022-02-20 18:51:46,585 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:51:46,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:46,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963137615] [2022-02-20 18:51:46,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963137615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:46,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:46,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:51:46,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101907139] [2022-02-20 18:51:46,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:46,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:51:46,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:46,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:51:46,620 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:51:46,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:51:46,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:51:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:51:46,622 INFO L87 Difference]: Start difference. First operand 546 states and 836 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:51:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:47,686 INFO L93 Difference]: Finished difference Result 1374 states and 2132 transitions. [2022-02-20 18:51:47,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:51:47,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:51:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:51:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-02-20 18:51:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:51:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-02-20 18:51:47,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 314 transitions. [2022-02-20 18:51:47,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:47,906 INFO L225 Difference]: With dead ends: 1374 [2022-02-20 18:51:47,906 INFO L226 Difference]: Without dead ends: 931 [2022-02-20 18:51:47,908 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:51:47,912 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 67 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:47,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-20 18:51:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2022-02-20 18:51:48,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:48,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have 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:51:48,691 INFO L74 IsIncluded]: Start isIncluded. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have 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:51:48,692 INFO L87 Difference]: Start difference. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have 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:51:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:48,720 INFO L93 Difference]: Finished difference Result 931 states and 1415 transitions. [2022-02-20 18:51:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1415 transitions. [2022-02-20 18:51:48,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:48,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:48,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:51:48,724 INFO L87 Difference]: Start difference. First operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:51:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:48,750 INFO L93 Difference]: Finished difference Result 931 states and 1415 transitions. [2022-02-20 18:51:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1415 transitions. [2022-02-20 18:51:48,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:48,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:48,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:48,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.5237068965517242) internal successors, (1414), 928 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have 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:51:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1414 transitions. [2022-02-20 18:51:48,791 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1414 transitions. Word has length 64 [2022-02-20 18:51:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:48,791 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1414 transitions. [2022-02-20 18:51:48,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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:51:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1414 transitions. [2022-02-20 18:51:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:48,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:48,792 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:51:48,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:51:48,792 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1017922373, now seen corresponding path program 1 times [2022-02-20 18:51:48,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:48,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919957072] [2022-02-20 18:51:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:48,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {16025#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {16025#true} is VALID [2022-02-20 18:51:48,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {16025#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {16025#true} is VALID [2022-02-20 18:51:48,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {16025#true} assume 0 == ~r1~0; {16025#true} is VALID [2022-02-20 18:51:48,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {16025#true} assume ~id1~0 >= 0; {16025#true} is VALID [2022-02-20 18:51:48,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {16025#true} assume 0 == ~st1~0; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:48,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~send1~0 == ~id1~0; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:48,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~mode1~0 % 256; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:48,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume ~id2~0 >= 0; {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} is VALID [2022-02-20 18:51:48,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {16027#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= ~st1~0 0)) (or (<= 0 ~st1~0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))))} assume 0 == ~st2~0; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:48,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:48,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:48,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:51:48,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {16028#(and (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:48,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send3~0 == ~id3~0; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:48,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode3~0 % 256; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:48,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id4~0 >= 0; {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:51:48,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {16029#(and (or (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~send4~0 == ~id4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~mode4~0 % 256; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id2~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id3~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id1~0 != ~id4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id3~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id2~0 != ~id4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} 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;main_~main__i2~0#1 := 0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(~r1~0 >= 4); {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {16030#(and (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (< 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0 1)))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {16026#false} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {16026#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {16026#false} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {16026#false} assume 0 == main_~assert__arg~1#1 % 256; {16026#false} is VALID [2022-02-20 18:51:48,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {16026#false} assume !false; {16026#false} is VALID [2022-02-20 18:51:48,961 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:51:48,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:48,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919957072] [2022-02-20 18:51:48,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919957072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:48,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:48,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:48,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962247265] [2022-02-20 18:51:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:48,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:48,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:49,004 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:51:49,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:49,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:49,005 INFO L87 Difference]: Start difference. First operand 929 states and 1414 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:50,416 INFO L93 Difference]: Finished difference Result 1757 states and 2692 transitions. [2022-02-20 18:51:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-02-20 18:51:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 347 transitions. [2022-02-20 18:51:50,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 347 transitions. [2022-02-20 18:51:50,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:50,650 INFO L225 Difference]: With dead ends: 1757 [2022-02-20 18:51:50,650 INFO L226 Difference]: Without dead ends: 931 [2022-02-20 18:51:50,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:51:50,652 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 426 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:50,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 517 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:51:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-02-20 18:51:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 929. [2022-02-20 18:51:51,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:51,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have 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:51:51,544 INFO L74 IsIncluded]: Start isIncluded. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have 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:51:51,545 INFO L87 Difference]: Start difference. First operand 931 states. Second operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have 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:51:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,571 INFO L93 Difference]: Finished difference Result 931 states and 1410 transitions. [2022-02-20 18:51:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1410 transitions. [2022-02-20 18:51:51,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:51,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:51,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:51:51,575 INFO L87 Difference]: Start difference. First operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 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 931 states. [2022-02-20 18:51:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:51,601 INFO L93 Difference]: Finished difference Result 931 states and 1410 transitions. [2022-02-20 18:51:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1410 transitions. [2022-02-20 18:51:51,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:51,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:51,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:51,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.5183189655172413) internal successors, (1409), 928 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have 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:51:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1409 transitions. [2022-02-20 18:51:51,636 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1409 transitions. Word has length 64 [2022-02-20 18:51:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:51,636 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 1409 transitions. [2022-02-20 18:51:51,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1409 transitions. [2022-02-20 18:51:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:51:51,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:51,637 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:51:51,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:51:51,637 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 145774506, now seen corresponding path program 1 times [2022-02-20 18:51:51,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:51,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853660665] [2022-02-20 18:51:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:51,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:51,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {21608#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {21608#true} is VALID [2022-02-20 18:51:51,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {21608#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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {21608#true} is VALID [2022-02-20 18:51:51,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {21608#true} assume 0 == ~r1~0; {21608#true} is VALID [2022-02-20 18:51:51,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {21608#true} assume ~id1~0 >= 0; {21608#true} is VALID [2022-02-20 18:51:51,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {21608#true} assume 0 == ~st1~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {21610#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {21610#(<= ~st1~0 0)} assume ~id2~0 >= 0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~st2~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {21610#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {21610#(<= ~st1~0 0)} assume ~id3~0 >= 0; {21610#(<= ~st1~0 0)} is VALID [2022-02-20 18:51:51,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {21610#(<= ~st1~0 0)} assume 0 == ~st3~0; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id4~0 >= 0; {21611#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {21611#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {21612#(<= (+ ~st4~0 ~st3~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;main_~main__i2~0#1 := 0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 4); {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:51:51,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {21612#(<= (+ ~st4~0 ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(main_~node4__m4~1#1 != ~nomsg~0); {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} is VALID [2022-02-20 18:51:51,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {21613#(and (= (+ (- 1) ~st2~0) 0) (<= (+ ~st4~0 ~st3~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);main_~check__tmp~1#1 := 0; {21609#false} is VALID [2022-02-20 18:51:51,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {21609#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {21609#false} is VALID [2022-02-20 18:51:51,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {21609#false} assume 0 == main_~assert__arg~1#1 % 256; {21609#false} is VALID [2022-02-20 18:51:51,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {21609#false} assume !false; {21609#false} is VALID [2022-02-20 18:51:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:51,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:51,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853660665] [2022-02-20 18:51:51,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853660665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:51,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:51,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:51:51,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815844575] [2022-02-20 18:51:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:51,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:51,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:51,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:51,770 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:51:51,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:51:51,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:51:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:51:51,771 INFO L87 Difference]: Start difference. First operand 929 states and 1409 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:53,870 INFO L93 Difference]: Finished difference Result 1689 states and 2577 transitions. [2022-02-20 18:51:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:51:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2022-02-20 18:51:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 614 transitions. [2022-02-20 18:51:53,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 614 transitions. [2022-02-20 18:51:54,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:54,311 INFO L225 Difference]: With dead ends: 1689 [2022-02-20 18:51:54,311 INFO L226 Difference]: Without dead ends: 1504 [2022-02-20 18:51:54,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:54,312 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 643 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:54,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 937 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2022-02-20 18:51:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1123. [2022-02-20 18:51:55,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:55,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1504 states. Second operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have 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:51:55,454 INFO L74 IsIncluded]: Start isIncluded. First operand 1504 states. Second operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have 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:51:55,455 INFO L87 Difference]: Start difference. First operand 1504 states. Second operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have 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:51:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:55,520 INFO L93 Difference]: Finished difference Result 1504 states and 2290 transitions. [2022-02-20 18:51:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2290 transitions. [2022-02-20 18:51:55,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:55,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:55,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 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 1504 states. [2022-02-20 18:51:55,527 INFO L87 Difference]: Start difference. First operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 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 1504 states. [2022-02-20 18:51:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:55,584 INFO L93 Difference]: Finished difference Result 1504 states and 2290 transitions. [2022-02-20 18:51:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2290 transitions. [2022-02-20 18:51:55,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:55,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:55,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:55,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.5222816399286987) internal successors, (1708), 1122 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have 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:51:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1708 transitions. [2022-02-20 18:51:55,631 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1708 transitions. Word has length 64 [2022-02-20 18:51:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:55,635 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1708 transitions. [2022-02-20 18:51:55,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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:51:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1708 transitions. [2022-02-20 18:51:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:51:55,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:55,637 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:51:55,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:51:55,637 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1968503380, now seen corresponding path program 1 times [2022-02-20 18:51:55,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:55,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920103569] [2022-02-20 18:51:55,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:55,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {28511#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {28513#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:55,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {28513#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {28513#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:55,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {28513#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {28513#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:55,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {28513#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {28514#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:55,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {28514#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {28514#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:51:55,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {28514#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~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;main_~main__i2~0#1 := 0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {28515#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:51:55,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {28515#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {28512#false} is VALID [2022-02-20 18:51:55,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {28512#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {28512#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:51:55,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {28512#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {28512#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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {28512#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 34: Hoare triple {28512#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {28512#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {28512#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {28512#false} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {28512#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {28512#false} is VALID [2022-02-20 18:51:55,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {28512#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {28512#false} assume !(~r1~0 >= 4); {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {28512#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {28512#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 43: Hoare triple {28512#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {28512#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {28512#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {28512#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:51:55,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {28512#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {28512#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {28512#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {28512#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {28512#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {28512#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {28512#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {28512#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {28512#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {28512#false} is VALID [2022-02-20 18:51:55,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {28512#false} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {28512#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {28512#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 59: Hoare triple {28512#false} assume ~r1~0 >= 4; {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {28512#false} assume !(~r1~0 < 4); {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {28512#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {28512#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {28512#false} assume 0 == main_~assert__arg~1#1 % 256; {28512#false} is VALID [2022-02-20 18:51:55,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {28512#false} assume !false; {28512#false} is VALID [2022-02-20 18:51:55,705 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:51:55,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:55,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920103569] [2022-02-20 18:51:55,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920103569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:55,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:55,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:51:55,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021184221] [2022-02-20 18:51:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:51:55,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:55,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:51:55,740 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:51:55,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:51:55,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:51:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:51:55,741 INFO L87 Difference]: Start difference. First operand 1123 states and 1708 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:51:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:59,582 INFO L93 Difference]: Finished difference Result 3265 states and 5000 transitions. [2022-02-20 18:51:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:51:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:51:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:51:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2022-02-20 18:51:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:51:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2022-02-20 18:51:59,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 404 transitions. [2022-02-20 18:51:59,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:00,031 INFO L225 Difference]: With dead ends: 3265 [2022-02-20 18:52:00,031 INFO L226 Difference]: Without dead ends: 2172 [2022-02-20 18:52:00,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:00,033 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 651 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:00,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [651 Valid, 144 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2022-02-20 18:52:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170. [2022-02-20 18:52:03,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:03,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2172 states. Second operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have 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:52:03,091 INFO L74 IsIncluded]: Start isIncluded. First operand 2172 states. Second operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have 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:52:03,093 INFO L87 Difference]: Start difference. First operand 2172 states. Second operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have 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:52:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,222 INFO L93 Difference]: Finished difference Result 2172 states and 3300 transitions. [2022-02-20 18:52:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3300 transitions. [2022-02-20 18:52:03,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:03,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:03,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 0 states have call successors, (0), 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 2172 states. [2022-02-20 18:52:03,235 INFO L87 Difference]: Start difference. First operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 0 states have call successors, (0), 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 2172 states. [2022-02-20 18:52:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:03,361 INFO L93 Difference]: Finished difference Result 2172 states and 3300 transitions. [2022-02-20 18:52:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3300 transitions. [2022-02-20 18:52:03,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:03,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:03,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:03,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.5209774089442138) internal successors, (3299), 2169 states have internal predecessors, (3299), 0 states have call successors, (0), 0 states have 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:52:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3299 transitions. [2022-02-20 18:52:03,539 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3299 transitions. Word has length 65 [2022-02-20 18:52:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:03,539 INFO L470 AbstractCegarLoop]: Abstraction has 2170 states and 3299 transitions. [2022-02-20 18:52:03,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 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:52:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3299 transitions. [2022-02-20 18:52:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:52:03,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:03,540 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] [2022-02-20 18:52:03,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:52:03,541 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1032507974, now seen corresponding path program 1 times [2022-02-20 18:52:03,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:03,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340786100] [2022-02-20 18:52:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:03,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {40398#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {40400#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {40400#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:03,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {40400#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {40401#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:03,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {40401#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {40401#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:52:03,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {40401#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~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;main_~main__i2~0#1 := 0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send1~0 != ~nomsg~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {40402#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:52:03,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {40402#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {40399#false} is VALID [2022-02-20 18:52:03,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {40399#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {40399#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {40399#false} assume !(~r1~0 >= 4); {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {40399#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {40399#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {40399#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {40399#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {40399#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {40399#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {40399#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {40399#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {40399#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {40399#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {40399#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {40399#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {40399#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {40399#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {40399#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {40399#false} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {40399#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {40399#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {40399#false} assume ~r1~0 >= 4; {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {40399#false} assume !(~r1~0 < 4); {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {40399#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {40399#false} is VALID [2022-02-20 18:52:03,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {40399#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {40399#false} is VALID [2022-02-20 18:52:03,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {40399#false} assume 0 == main_~assert__arg~1#1 % 256; {40399#false} is VALID [2022-02-20 18:52:03,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {40399#false} assume !false; {40399#false} is VALID [2022-02-20 18:52:03,605 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:52:03,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:03,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340786100] [2022-02-20 18:52:03,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340786100] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:03,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:03,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:03,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482185275] [2022-02-20 18:52:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:52:03,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:03,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:03,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:03,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:03,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:03,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:03,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:03,643 INFO L87 Difference]: Start difference. First operand 2170 states and 3299 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:08,373 INFO L93 Difference]: Finished difference Result 4298 states and 6553 transitions. [2022-02-20 18:52:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:08,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-02-20 18:52:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 283 transitions. [2022-02-20 18:52:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 283 transitions. [2022-02-20 18:52:08,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 283 transitions. [2022-02-20 18:52:08,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:08,729 INFO L225 Difference]: With dead ends: 4298 [2022-02-20 18:52:08,729 INFO L226 Difference]: Without dead ends: 2170 [2022-02-20 18:52:08,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:08,732 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 410 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:08,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 113 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:52:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-02-20 18:52:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2022-02-20 18:52:12,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:12,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have 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:52:12,497 INFO L74 IsIncluded]: Start isIncluded. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have 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:52:12,498 INFO L87 Difference]: Start difference. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have 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:52:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,626 INFO L93 Difference]: Finished difference Result 2170 states and 3254 transitions. [2022-02-20 18:52:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3254 transitions. [2022-02-20 18:52:12,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:12,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:12,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 0 states have call successors, (0), 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 2170 states. [2022-02-20 18:52:12,632 INFO L87 Difference]: Start difference. First operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 0 states have call successors, (0), 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 2170 states. [2022-02-20 18:52:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:12,783 INFO L93 Difference]: Finished difference Result 2170 states and 3254 transitions. [2022-02-20 18:52:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3254 transitions. [2022-02-20 18:52:12,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:12,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:12,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:12,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.500230520977409) internal successors, (3254), 2169 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have 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:52:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3254 transitions. [2022-02-20 18:52:12,963 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3254 transitions. Word has length 66 [2022-02-20 18:52:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:12,963 INFO L470 AbstractCegarLoop]: Abstraction has 2170 states and 3254 transitions. [2022-02-20 18:52:12,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:52:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3254 transitions. [2022-02-20 18:52:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:52:12,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:12,964 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:52:12,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:52:12,964 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1666418400, now seen corresponding path program 1 times [2022-02-20 18:52:12,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:12,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178055861] [2022-02-20 18:52:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:13,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {53725#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {53727#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:13,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {53727#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {53727#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:13,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {53727#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {53727#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:13,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {53727#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {53727#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:13,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {53727#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {53727#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:13,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {53727#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {53727#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:13,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {53727#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {53727#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:13,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {53727#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {53728#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:13,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {53728#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {53728#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:52:13,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {53728#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {53729#(<= (+ ~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;main_~main__i2~0#1 := 0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {53729#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:52:13,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {53729#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {53726#false} is VALID [2022-02-20 18:52:13,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {53726#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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {53726#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {53726#false} is VALID [2022-02-20 18:52:13,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {53726#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {53726#false} is VALID [2022-02-20 18:52:13,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {53726#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {53726#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {53726#false} assume ~send4~0 != ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {53726#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {53726#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {53726#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {53726#false} assume !(~r1~0 >= 4); {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {53726#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {53726#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {53726#false} is VALID [2022-02-20 18:52:13,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {53726#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {53726#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {53726#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {53726#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {53726#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {53726#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {53726#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {53726#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {53726#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 54: Hoare triple {53726#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {53726#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {53726#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {53726#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {53726#false} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 59: Hoare triple {53726#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 60: Hoare triple {53726#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {53726#false} is VALID [2022-02-20 18:52:13,028 INFO L290 TraceCheckUtils]: 61: Hoare triple {53726#false} assume ~r1~0 >= 4; {53726#false} is VALID [2022-02-20 18:52:13,029 INFO L290 TraceCheckUtils]: 62: Hoare triple {53726#false} assume !(~r1~0 < 4); {53726#false} is VALID [2022-02-20 18:52:13,029 INFO L290 TraceCheckUtils]: 63: Hoare triple {53726#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {53726#false} is VALID [2022-02-20 18:52:13,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {53726#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {53726#false} is VALID [2022-02-20 18:52:13,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {53726#false} assume 0 == main_~assert__arg~1#1 % 256; {53726#false} is VALID [2022-02-20 18:52:13,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {53726#false} assume !false; {53726#false} is VALID [2022-02-20 18:52:13,029 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:52:13,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:13,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178055861] [2022-02-20 18:52:13,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178055861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:13,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:13,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:13,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142409009] [2022-02-20 18:52:13,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:13,031 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:52:13,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:13,031 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:52:13,067 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:52:13,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:13,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:13,069 INFO L87 Difference]: Start difference. First operand 2170 states and 3254 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) [2022-02-20 18:52:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:18,272 INFO L93 Difference]: Finished difference Result 4306 states and 6473 transitions. [2022-02-20 18:52:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:18,272 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:52:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:52:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2022-02-20 18:52:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 18:52:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2022-02-20 18:52:18,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 289 transitions. [2022-02-20 18:52:18,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:18,657 INFO L225 Difference]: With dead ends: 4306 [2022-02-20 18:52:18,657 INFO L226 Difference]: Without dead ends: 2170 [2022-02-20 18:52:18,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:18,659 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 426 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:18,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 97 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-02-20 18:52:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2022-02-20 18:52:23,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:23,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have 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:52:23,016 INFO L74 IsIncluded]: Start isIncluded. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have 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:52:23,018 INFO L87 Difference]: Start difference. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have 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:52:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,146 INFO L93 Difference]: Finished difference Result 2170 states and 3209 transitions. [2022-02-20 18:52:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3209 transitions. [2022-02-20 18:52:23,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 0 states have call successors, (0), 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 2170 states. [2022-02-20 18:52:23,151 INFO L87 Difference]: Start difference. First operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 0 states have call successors, (0), 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 2170 states. [2022-02-20 18:52:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:23,278 INFO L93 Difference]: Finished difference Result 2170 states and 3209 transitions. [2022-02-20 18:52:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3209 transitions. [2022-02-20 18:52:23,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:23,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:23,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:23,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.479483633010604) internal successors, (3209), 2169 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have 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:52:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3209 transitions. [2022-02-20 18:52:23,461 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3209 transitions. Word has length 67 [2022-02-20 18:52:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:23,461 INFO L470 AbstractCegarLoop]: Abstraction has 2170 states and 3209 transitions. [2022-02-20 18:52:23,461 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 18:52:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3209 transitions. [2022-02-20 18:52:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:52:23,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:23,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:23,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:52:23,462 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1540735366, now seen corresponding path program 1 times [2022-02-20 18:52:23,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:23,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70279308] [2022-02-20 18:52:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:23,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {67062#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {67064#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {67064#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:23,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {67064#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {67065#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:23,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {67065#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {67065#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:52:23,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {67065#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~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;main_~main__i2~0#1 := 0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {67066#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:52:23,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {67066#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {67063#false} is VALID [2022-02-20 18:52:23,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {67063#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {67063#false} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {67063#false} is VALID [2022-02-20 18:52:23,518 INFO L290 TraceCheckUtils]: 39: Hoare triple {67063#false} assume ~send4~0 != ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,518 INFO L290 TraceCheckUtils]: 40: Hoare triple {67063#false} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {67063#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {67063#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {67063#false} assume !(~r1~0 >= 4); {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {67063#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {67063#false} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {67063#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {67063#false} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {67063#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {67063#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {67063#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {67063#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {67063#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {67063#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {67063#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {67063#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {67063#false} is VALID [2022-02-20 18:52:23,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {67063#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {67063#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {67063#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {67063#false} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {67063#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {67063#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {67063#false} assume ~r1~0 >= 4; {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {67063#false} assume !(~r1~0 < 4); {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {67063#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {67063#false} is VALID [2022-02-20 18:52:23,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {67063#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {67063#false} is VALID [2022-02-20 18:52:23,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {67063#false} assume 0 == main_~assert__arg~1#1 % 256; {67063#false} is VALID [2022-02-20 18:52:23,522 INFO L290 TraceCheckUtils]: 67: Hoare triple {67063#false} assume !false; {67063#false} is VALID [2022-02-20 18:52:23,522 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:52:23,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:23,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70279308] [2022-02-20 18:52:23,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70279308] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:23,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:23,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:52:23,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505896983] [2022-02-20 18:52:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:23,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:52:23,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:23,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:52:23,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:23,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:52:23,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:52:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:52:23,564 INFO L87 Difference]: Start difference. First operand 2170 states and 3209 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:52:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:29,490 INFO L93 Difference]: Finished difference Result 4302 states and 6379 transitions. [2022-02-20 18:52:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:52:29,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:52:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:52:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:52:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 281 transitions. [2022-02-20 18:52:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:52:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 281 transitions. [2022-02-20 18:52:29,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 281 transitions. [2022-02-20 18:52:29,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:29,839 INFO L225 Difference]: With dead ends: 4302 [2022-02-20 18:52:29,839 INFO L226 Difference]: Without dead ends: 2170 [2022-02-20 18:52:29,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:52:29,841 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 408 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:52:29,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 105 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:52:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-02-20 18:52:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2022-02-20 18:52:34,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:52:34,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have 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:52:34,821 INFO L74 IsIncluded]: Start isIncluded. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have 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:52:34,822 INFO L87 Difference]: Start difference. First operand 2170 states. Second operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have 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:52:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:34,951 INFO L93 Difference]: Finished difference Result 2170 states and 3164 transitions. [2022-02-20 18:52:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3164 transitions. [2022-02-20 18:52:34,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:34,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:34,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 0 states have call successors, (0), 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 2170 states. [2022-02-20 18:52:34,955 INFO L87 Difference]: Start difference. First operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 0 states have call successors, (0), 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 2170 states. [2022-02-20 18:52:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:52:35,084 INFO L93 Difference]: Finished difference Result 2170 states and 3164 transitions. [2022-02-20 18:52:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3164 transitions. [2022-02-20 18:52:35,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:52:35,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:52:35,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:52:35,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:52:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.458736745043799) internal successors, (3164), 2169 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have 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:52:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3164 transitions. [2022-02-20 18:52:35,274 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3164 transitions. Word has length 68 [2022-02-20 18:52:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:52:35,274 INFO L470 AbstractCegarLoop]: Abstraction has 2170 states and 3164 transitions. [2022-02-20 18:52:35,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:52:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3164 transitions. [2022-02-20 18:52:35,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:52:35,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:52:35,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:52:35,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:52:35,275 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:52:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:52:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash -147544852, now seen corresponding path program 1 times [2022-02-20 18:52:35,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:52:35,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986672072] [2022-02-20 18:52:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:52:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:52:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:52:35,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {80394#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(50, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~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];~__return_2937~0 := 0;~__return_3028~0 := 0;~__tmp_3187_0~0 := 0;~__return_3195~0 := 0;~__return_3122~0 := 0; {80396#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:52:35,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {80396#(<= (+ ~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_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~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;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~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;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_~init__tmp~0#1; {80397#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:35,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {80397#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {80397#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:35,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {80397#(and (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {80398#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:35,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {80398#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {80398#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:52:35,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {80398#(and (<= 0 ~id1~0) (<= ~id1~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id4~0 >= 0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~st4~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send4~0 == ~id4~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume 0 == ~mode4~0 % 256; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id1~0 != ~id4~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id2~0 != ~id4~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~id3~0 != ~id4~0;main_~init__tmp~0#1 := 1;~__return_2937~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_2937~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~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;main_~main__i2~0#1 := 0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:52:35,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {80399#(and (<= ~send1~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {80400#(and (<= (+ ~nomsg~0 1) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 127) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|))} is VALID [2022-02-20 18:52:35,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {80400#(and (<= (+ ~nomsg~0 1) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 127) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send2~0 != ~nomsg~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} ~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);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send3~0 != ~nomsg~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume !!(0 == ~mode4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~send4~0 != ~nomsg~0; {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} is VALID [2022-02-20 18:52:35,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {80401#(<= (+ ~nomsg~0 1) ~p1_new~0)} assume ~p4_new~0 == ~nomsg~0;main_~node4____CPAchecker_TMP_0~0#1 := ~send4~0; {80402#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|)))) (or (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|))) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} is VALID [2022-02-20 18:52:35,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {80402#(or (and (or (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= (+ ~nomsg~0 (* (- 1) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|) 256 (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256)) 0)))) (and (or (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127)) (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) (- 256) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|)))) (or (not (= ~p1_new~0 (+ (* (- 256) (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256)) |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1|))) (not (<= |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node4____CPAchecker_TMP_0~0#1| 256) 256) 127))))))} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256);~mode4~0 := 1;~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;havoc main_~check__tmp~0#1; {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:35,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:35,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(~r1~0 >= 4); {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:35,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:35,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume ~r1~0 < 4;main_~check__tmp~0#1 := 1;~__return_3028~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_3028~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; {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:35,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:35,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume main_~main__i2~0#1 < 8;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} is VALID [2022-02-20 18:52:35,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {80403#(or (not (= ~p4_old~0 ~p1_old~0)) (not (= ~nomsg~0 ~p4_old~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {80404#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} is VALID [2022-02-20 18:52:35,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {80404#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1|)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {80405#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:35,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {80405#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {80405#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:52:35,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {80405#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {80406#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {80406#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {80395#false} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {80395#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {80395#false} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {80395#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {80395#false} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {80395#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {80395#false} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 57: Hoare triple {80395#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {80395#false} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 58: Hoare triple {80395#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {80395#false} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 59: Hoare triple {80395#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {80395#false} is VALID [2022-02-20 18:52:35,530 INFO L290 TraceCheckUtils]: 60: Hoare triple {80395#false} ~mode4~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;~__tmp_3187_0~0 := main_~main____CPAchecker_TMP_0~0#1; {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 61: Hoare triple {80395#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_3187_0~0;havoc main_~check__tmp~1#1; {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 62: Hoare triple {80395#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 63: Hoare triple {80395#false} assume ~r1~0 >= 4; {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 64: Hoare triple {80395#false} assume !(~r1~0 < 4); {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 65: Hoare triple {80395#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0);main_~check__tmp~1#1 := 0; {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 66: Hoare triple {80395#false} ~__return_3195~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_3195~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 67: Hoare triple {80395#false} assume 0 == main_~assert__arg~1#1 % 256; {80395#false} is VALID [2022-02-20 18:52:35,531 INFO L290 TraceCheckUtils]: 68: Hoare triple {80395#false} assume !false; {80395#false} is VALID [2022-02-20 18:52:35,532 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:52:35,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:52:35,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986672072] [2022-02-20 18:52:35,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986672072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:52:35,532 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:52:35,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:52:35,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930442260] [2022-02-20 18:52:35,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:52:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-02-20 18:52:35,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:52:35,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:52:35,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:52:35,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:52:35,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:52:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:52:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:52:35,579 INFO L87 Difference]: Start difference. First operand 2170 states and 3164 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)