./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-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 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:43:51,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:43:51,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:43:51,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:43:51,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:43:51,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:43:51,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:43:51,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:43:51,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:43:51,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:43:51,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:43:51,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:43:51,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:43:51,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:43:51,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:43:51,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:43:51,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:43:51,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:43:51,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:43:51,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:43:51,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:43:51,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:43:51,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:43:51,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:43:51,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:43:51,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:43:51,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:43:51,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:43:51,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:43:51,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:43:51,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:43:51,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:43:51,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:43:51,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:43:51,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:43:51,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:43:51,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:43:51,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:43:51,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:43:51,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:43:51,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:43:51,805 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:43:51,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:43:51,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:43:51,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:43:51,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:43:51,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:43:51,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:43:51,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:43:51,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:43:51,840 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:43:51,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:43:51,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:43:51,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:43:51,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:43:51,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:43:51,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:43:51,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:43:51,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:43:51,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:43:51,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:43:51,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:43:51,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:43:51,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:43:51,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:43:51,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:43:51,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:51,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:43:51,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:43:51,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:43:51,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:43:51,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:43:51,845 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:43:51,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:43:51,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:43:51,846 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 -> 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 [2022-02-20 18:43:51,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:43:52,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:43:52,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:43:52,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:43:52,018 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:43:52,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:43:52,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bf30ae7/5ba2564963d94919ada2e16be80d7b84/FLAG4cfecc20d [2022-02-20 18:43:52,503 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:43:52,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:43:52,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bf30ae7/5ba2564963d94919ada2e16be80d7b84/FLAG4cfecc20d [2022-02-20 18:43:52,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4bf30ae7/5ba2564963d94919ada2e16be80d7b84 [2022-02-20 18:43:52,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:43:52,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:43:52,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:52,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:43:52,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:43:52,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373266c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:52, skipping insertion in model container [2022-02-20 18:43:52,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:43:52" (1/1) ... [2022-02-20 18:43:52,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:43:52,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:43:52,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2022-02-20 18:43:52,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2022-02-20 18:43:52,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2022-02-20 18:43:52,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2022-02-20 18:43:52,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:53,006 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:43:53,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2022-02-20 18:43:53,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2022-02-20 18:43:53,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2022-02-20 18:43:53,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2022-02-20 18:43:53,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:43:53,141 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:43:53,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53 WrapperNode [2022-02-20 18:43:53,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:43:53,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:53,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:43:53,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:43:53,146 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:43:53" (1/1) ... [2022-02-20 18:43:53,164 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:43:53" (1/1) ... [2022-02-20 18:43:53,217 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2418 [2022-02-20 18:43:53,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:43:53,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:43:53,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:43:53,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:43:53,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:43:53,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:43:53,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:43:53,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:43:53,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (1/1) ... [2022-02-20 18:43:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:43:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:43:53,346 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:43:53,351 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:43:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:43:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:43:53,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:43:53,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:43:53,490 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:43:53,491 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:43:54,506 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:43:54,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:43:54,516 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:43:54,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:54 BoogieIcfgContainer [2022-02-20 18:43:54,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:43:54,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:43:54,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:43:54,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:43:54,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:43:52" (1/3) ... [2022-02-20 18:43:54,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dea04f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:54, skipping insertion in model container [2022-02-20 18:43:54,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:43:53" (2/3) ... [2022-02-20 18:43:54,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dea04f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:43:54, skipping insertion in model container [2022-02-20 18:43:54,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:43:54" (3/3) ... [2022-02-20 18:43:54,523 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2022-02-20 18:43:54,526 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:43:54,526 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 18:43:54,568 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:43:54,572 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:43:54,573 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 18:43:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have 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:43:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:43:54,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:54,612 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] [2022-02-20 18:43:54,613 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash 26036561, now seen corresponding path program 1 times [2022-02-20 18:43:54,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:54,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20393049] [2022-02-20 18:43:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:54,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {459#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {461#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:54,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {461#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:54,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {461#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:54,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {461#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {461#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:43:54,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {461#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {462#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:54,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {462#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {462#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:43:54,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {463#(<= (+ ~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {463#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:43:54,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {463#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~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~4#1;main_~node2__m2~4#1 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {460#false} assume !!(0 == ~mode2~0 % 256); {460#false} is VALID [2022-02-20 18:43:54,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {460#false} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~2#1; {460#false} is VALID [2022-02-20 18:43:54,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {460#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~2#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~2#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~2#1 % 256 else main_~node2____CPAchecker_TMP_0~2#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~10#1;main_~node3__m3~10#1 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {460#false} assume !!(0 == ~mode3~0 % 256); {460#false} is VALID [2022-02-20 18:43:54,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {460#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~6#1; {460#false} is VALID [2022-02-20 18:43:54,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {460#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~6#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~6#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~6#1 % 256 else main_~node3____CPAchecker_TMP_0~6#1 % 256 - 256);~mode3~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;havoc main_~check__tmp~30#1; {460#false} is VALID [2022-02-20 18:43:54,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {460#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {460#false} is VALID [2022-02-20 18:43:54,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {460#false} assume ~r1~0 % 256 < 3;main_~check__tmp~30#1 := 1;~__return_6426~0 := main_~check__tmp~30#1;main_~main__c1~0#1 := ~__return_6426~0;havoc main_~__tmp_30~0#1;main_~__tmp_30~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~29#1;main_~assert__arg~29#1 := main_~__tmp_30~0#1; {460#false} is VALID [2022-02-20 18:43:54,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {460#false} assume !(0 == main_~assert__arg~29#1 % 256); {460#false} is VALID [2022-02-20 18:43:54,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {460#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {460#false} assume !(0 == ~mode1~0 % 256); {460#false} is VALID [2022-02-20 18:43:54,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {460#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {460#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {460#false} is VALID [2022-02-20 18:43:54,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {460#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {460#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {460#false} assume main_~node2__m2~1#1 != ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {460#false} assume !(0 == ~alive2~0 % 256); {460#false} is VALID [2022-02-20 18:43:54,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {460#false} assume !(main_~node2__m2~1#1 > ~id2~0); {460#false} is VALID [2022-02-20 18:43:54,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {460#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,867 INFO L290 TraceCheckUtils]: 42: Hoare triple {460#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,867 INFO L290 TraceCheckUtils]: 43: Hoare triple {460#false} assume main_~node3__m3~3#1 != ~nomsg~0; {460#false} is VALID [2022-02-20 18:43:54,867 INFO L290 TraceCheckUtils]: 44: Hoare triple {460#false} assume !(0 == ~alive3~0 % 256); {460#false} is VALID [2022-02-20 18:43:54,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {460#false} assume !(main_~node3__m3~3#1 > ~id3~0); {460#false} is VALID [2022-02-20 18:43:54,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {460#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~5#1; {460#false} is VALID [2022-02-20 18:43:54,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {460#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7703~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7703~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {460#false} is VALID [2022-02-20 18:43:54,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {460#false} assume 0 == main_~assert__arg~5#1 % 256; {460#false} is VALID [2022-02-20 18:43:54,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {460#false} assume !false; {460#false} is VALID [2022-02-20 18:43:54,871 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:43:54,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:54,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20393049] [2022-02-20 18:43:54,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20393049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:54,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:54,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:43:54,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395955925] [2022-02-20 18:43:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:54,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:43:54,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:54,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:43:54,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:54,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:43:54,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:54,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:43:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:43:54,950 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:43:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:56,346 INFO L93 Difference]: Finished difference Result 834 states and 1473 transitions. [2022-02-20 18:43:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:43:56,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 18:43:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:43:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1473 transitions. [2022-02-20 18:43:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:43:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1473 transitions. [2022-02-20 18:43:56,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1473 transitions. [2022-02-20 18:43:57,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1473 edges. 1473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:57,345 INFO L225 Difference]: With dead ends: 834 [2022-02-20 18:43:57,345 INFO L226 Difference]: Without dead ends: 485 [2022-02-20 18:43:57,348 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:43:57,350 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 2286 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:57,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2286 Valid, 577 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:43:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-02-20 18:43:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 479. [2022-02-20 18:43:57,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:57,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 485 states. Second operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have 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:43:57,503 INFO L74 IsIncluded]: Start isIncluded. First operand 485 states. Second operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have 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:43:57,504 INFO L87 Difference]: Start difference. First operand 485 states. Second operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have 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:43:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:57,518 INFO L93 Difference]: Finished difference Result 485 states and 657 transitions. [2022-02-20 18:43:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 657 transitions. [2022-02-20 18:43:57,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:57,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:57,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 0 states have call successors, (0), 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 485 states. [2022-02-20 18:43:57,522 INFO L87 Difference]: Start difference. First operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 0 states have call successors, (0), 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 485 states. [2022-02-20 18:43:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:57,535 INFO L93 Difference]: Finished difference Result 485 states and 657 transitions. [2022-02-20 18:43:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 657 transitions. [2022-02-20 18:43:57,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:57,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:57,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:57,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have 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:43:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 653 transitions. [2022-02-20 18:43:57,552 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 653 transitions. Word has length 50 [2022-02-20 18:43:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:57,553 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 653 transitions. [2022-02-20 18:43:57,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:43:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 653 transitions. [2022-02-20 18:43:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:43:57,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:57,554 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] [2022-02-20 18:43:57,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:43:57,555 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1543870192, now seen corresponding path program 1 times [2022-02-20 18:43:57,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:57,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212560734] [2022-02-20 18:43:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:57,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {3013#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {3013#true} is VALID [2022-02-20 18:43:57,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {3013#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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {3013#true} is VALID [2022-02-20 18:43:57,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {3013#true} assume 0 == ~r1~0 % 256; {3013#true} is VALID [2022-02-20 18:43:57,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {3013#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {3013#true} is VALID [2022-02-20 18:43:57,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {3013#true} assume ~id1~0 >= 0; {3013#true} is VALID [2022-02-20 18:43:57,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {3013#true} assume 0 == ~st1~0; {3013#true} is VALID [2022-02-20 18:43:57,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {3013#true} assume ~send1~0 == ~id1~0; {3013#true} is VALID [2022-02-20 18:43:57,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {3013#true} assume 0 == ~mode1~0 % 256; {3013#true} is VALID [2022-02-20 18:43:57,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {3013#true} assume ~id2~0 >= 0; {3013#true} is VALID [2022-02-20 18:43:57,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {3013#true} assume 0 == ~st2~0; {3013#true} is VALID [2022-02-20 18:43:57,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {3013#true} assume ~send2~0 == ~id2~0; {3013#true} is VALID [2022-02-20 18:43:57,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {3013#true} assume 0 == ~mode2~0 % 256; {3013#true} is VALID [2022-02-20 18:43:57,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {3013#true} assume ~id3~0 >= 0; {3013#true} is VALID [2022-02-20 18:43:57,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {3013#true} assume 0 == ~st3~0; {3013#true} is VALID [2022-02-20 18:43:57,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {3013#true} assume ~send3~0 == ~id3~0; {3013#true} is VALID [2022-02-20 18:43:57,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {3013#true} assume 0 == ~mode3~0 % 256; {3013#true} is VALID [2022-02-20 18:43:57,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {3013#true} assume ~id1~0 != ~id2~0; {3013#true} is VALID [2022-02-20 18:43:57,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {3013#true} assume ~id1~0 != ~id3~0; {3013#true} is VALID [2022-02-20 18:43:57,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {3013#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {3013#true} is VALID [2022-02-20 18:43:57,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {3013#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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3013#true} is VALID [2022-02-20 18:43:57,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {3013#true} assume !!(0 == ~mode1~0 % 256); {3013#true} is VALID [2022-02-20 18:43:57,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {3013#true} assume !!(0 == ~alive1~0 % 256); {3013#true} is VALID [2022-02-20 18:43:57,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {3013#true} assume !(~send1~0 != ~id1~0); {3013#true} is VALID [2022-02-20 18:43:57,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {3013#true} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {3013#true} is VALID [2022-02-20 18:43:57,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {3013#true} assume !!(0 == ~mode2~0 % 256); {3013#true} is VALID [2022-02-20 18:43:57,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {3013#true} assume !!(0 == ~alive2~0 % 256); {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~16#1;main_~node3__m3~16#1 := ~nomsg~0; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~12#1; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~12#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~12#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~12#1 % 256 else main_~node3____CPAchecker_TMP_0~12#1 % 256 - 256);~mode3~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;havoc main_~check__tmp~54#1; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~54#1 := 1;~__return_8436~0 := main_~check__tmp~54#1;main_~main__c1~0#1 := ~__return_8436~0;havoc main_~__tmp_54~0#1;main_~__tmp_54~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~53#1;main_~assert__arg~53#1 := main_~__tmp_54~0#1; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == main_~assert__arg~53#1 % 256); {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode1~0 % 256); {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:43:57,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {3015#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {3014#false} is VALID [2022-02-20 18:43:57,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {3014#false} assume !(main_~node2__m2~1#1 > ~id2~0); {3014#false} is VALID [2022-02-20 18:43:57,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {3014#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {3014#false} is VALID [2022-02-20 18:43:57,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {3014#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3014#false} is VALID [2022-02-20 18:43:57,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {3014#false} assume main_~node3__m3~3#1 != ~nomsg~0; {3014#false} is VALID [2022-02-20 18:43:57,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {3014#false} assume !(0 == ~alive3~0 % 256); {3014#false} is VALID [2022-02-20 18:43:57,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {3014#false} assume !(main_~node3__m3~3#1 > ~id3~0); {3014#false} is VALID [2022-02-20 18:43:57,643 INFO L290 TraceCheckUtils]: 47: Hoare triple {3014#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~5#1; {3014#false} is VALID [2022-02-20 18:43:57,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {3014#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7703~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7703~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {3014#false} is VALID [2022-02-20 18:43:57,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {3014#false} assume 0 == main_~assert__arg~5#1 % 256; {3014#false} is VALID [2022-02-20 18:43:57,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {3014#false} assume !false; {3014#false} is VALID [2022-02-20 18:43:57,644 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:43:57,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:57,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212560734] [2022-02-20 18:43:57,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212560734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:57,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:57,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:57,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105646934] [2022-02-20 18:43:57,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:43:57,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:57,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:43:57,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:57,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:57,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:57,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:57,683 INFO L87 Difference]: Start difference. First operand 479 states and 653 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:43:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:58,353 INFO L93 Difference]: Finished difference Result 940 states and 1338 transitions. [2022-02-20 18:43:58,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:43:58,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:43:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:43:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:43:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2022-02-20 18:43:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:43:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2022-02-20 18:43:58,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 866 transitions. [2022-02-20 18:43:58,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:58,910 INFO L225 Difference]: With dead ends: 940 [2022-02-20 18:43:58,910 INFO L226 Difference]: Without dead ends: 686 [2022-02-20 18:43:58,911 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:43:58,912 INFO L933 BasicCegarLoop]: 510 mSDtfsCounter, 272 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:43:58,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 860 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:43:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-02-20 18:43:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 680. [2022-02-20 18:43:59,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:43:59,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 686 states. Second operand has 680 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 679 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have 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:43:59,170 INFO L74 IsIncluded]: Start isIncluded. First operand 686 states. Second operand has 680 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 679 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have 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:43:59,175 INFO L87 Difference]: Start difference. First operand 686 states. Second operand has 680 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 679 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have 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:43:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:59,193 INFO L93 Difference]: Finished difference Result 686 states and 955 transitions. [2022-02-20 18:43:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 955 transitions. [2022-02-20 18:43:59,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:59,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:59,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 680 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 679 states have internal predecessors, (951), 0 states have call successors, (0), 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 686 states. [2022-02-20 18:43:59,196 INFO L87 Difference]: Start difference. First operand has 680 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 679 states have internal predecessors, (951), 0 states have call successors, (0), 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 686 states. [2022-02-20 18:43:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:43:59,215 INFO L93 Difference]: Finished difference Result 686 states and 955 transitions. [2022-02-20 18:43:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 955 transitions. [2022-02-20 18:43:59,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:43:59,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:43:59,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:43:59,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:43:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 679 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have 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:43:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 951 transitions. [2022-02-20 18:43:59,239 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 951 transitions. Word has length 51 [2022-02-20 18:43:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:43:59,240 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 951 transitions. [2022-02-20 18:43:59,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:43:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 951 transitions. [2022-02-20 18:43:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:43:59,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:43:59,242 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] [2022-02-20 18:43:59,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:43:59,243 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:43:59,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:43:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash -359372662, now seen corresponding path program 1 times [2022-02-20 18:43:59,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:43:59,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408130396] [2022-02-20 18:43:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:43:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:43:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:43:59,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {6430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {6430#true} is VALID [2022-02-20 18:43:59,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {6430#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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {6430#true} is VALID [2022-02-20 18:43:59,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {6430#true} assume 0 == ~r1~0 % 256; {6430#true} is VALID [2022-02-20 18:43:59,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {6430#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {6430#true} is VALID [2022-02-20 18:43:59,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {6430#true} assume ~id1~0 >= 0; {6430#true} is VALID [2022-02-20 18:43:59,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {6430#true} assume 0 == ~st1~0; {6430#true} is VALID [2022-02-20 18:43:59,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {6430#true} assume ~send1~0 == ~id1~0; {6430#true} is VALID [2022-02-20 18:43:59,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {6430#true} assume 0 == ~mode1~0 % 256; {6430#true} is VALID [2022-02-20 18:43:59,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {6430#true} assume ~id2~0 >= 0; {6430#true} is VALID [2022-02-20 18:43:59,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {6430#true} assume 0 == ~st2~0; {6430#true} is VALID [2022-02-20 18:43:59,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {6430#true} assume ~send2~0 == ~id2~0; {6430#true} is VALID [2022-02-20 18:43:59,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {6430#true} assume 0 == ~mode2~0 % 256; {6430#true} is VALID [2022-02-20 18:43:59,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {6430#true} assume ~id3~0 >= 0; {6430#true} is VALID [2022-02-20 18:43:59,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {6430#true} assume 0 == ~st3~0; {6430#true} is VALID [2022-02-20 18:43:59,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {6430#true} assume ~send3~0 == ~id3~0; {6430#true} is VALID [2022-02-20 18:43:59,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {6430#true} assume 0 == ~mode3~0 % 256; {6430#true} is VALID [2022-02-20 18:43:59,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {6430#true} assume ~id1~0 != ~id2~0; {6430#true} is VALID [2022-02-20 18:43:59,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {6430#true} assume ~id1~0 != ~id3~0; {6430#true} is VALID [2022-02-20 18:43:59,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {6430#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {6430#true} is VALID [2022-02-20 18:43:59,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {6430#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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6430#true} is VALID [2022-02-20 18:43:59,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {6430#true} assume !!(0 == ~mode1~0 % 256); {6430#true} is VALID [2022-02-20 18:43:59,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {6430#true} assume !!(0 == ~alive1~0 % 256); {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send1~0 != ~id1~0); {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~16#1;main_~node3__m3~16#1 := ~nomsg~0; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~12#1; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~12#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~12#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~12#1 % 256 else main_~node3____CPAchecker_TMP_0~12#1 % 256 - 256);~mode3~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;havoc main_~check__tmp~54#1; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~54#1 := 1;~__return_8436~0 := main_~check__tmp~54#1;main_~main__c1~0#1 := ~__return_8436~0;havoc main_~__tmp_54~0#1;main_~__tmp_54~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~53#1;main_~assert__arg~53#1 := main_~__tmp_54~0#1; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == main_~assert__arg~53#1 % 256); {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~mode1~0 % 256); {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:43:59,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {6432#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {6431#false} is VALID [2022-02-20 18:43:59,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {6431#false} assume !(main_~node1__m1~1#1 > ~id1~0); {6431#false} is VALID [2022-02-20 18:43:59,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {6431#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {6431#false} is VALID [2022-02-20 18:43:59,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {6431#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6431#false} is VALID [2022-02-20 18:43:59,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {6431#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {6431#false} is VALID [2022-02-20 18:43:59,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {6431#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {6431#false} is VALID [2022-02-20 18:43:59,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {6431#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6431#false} is VALID [2022-02-20 18:43:59,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {6431#false} assume main_~node3__m3~4#1 != ~nomsg~0; {6431#false} is VALID [2022-02-20 18:43:59,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {6431#false} assume !(0 == ~alive3~0 % 256); {6431#false} is VALID [2022-02-20 18:43:59,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {6431#false} assume !(main_~node3__m3~4#1 > ~id3~0); {6431#false} is VALID [2022-02-20 18:43:59,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {6431#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~7#1; {6431#false} is VALID [2022-02-20 18:43:59,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {6431#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7021~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7021~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {6431#false} is VALID [2022-02-20 18:43:59,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {6431#false} assume 0 == main_~assert__arg~7#1 % 256; {6431#false} is VALID [2022-02-20 18:43:59,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {6431#false} assume !false; {6431#false} is VALID [2022-02-20 18:43:59,321 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:43:59,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:43:59,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408130396] [2022-02-20 18:43:59,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408130396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:43:59,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:43:59,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:43:59,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192245947] [2022-02-20 18:43:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:43:59,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:43:59,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:43:59,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:43:59,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:43:59,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:43:59,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:43:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:43:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:43:59,356 INFO L87 Difference]: Start difference. First operand 680 states and 951 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:00,365 INFO L93 Difference]: Finished difference Result 1566 states and 2244 transitions. [2022-02-20 18:44:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:44:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2022-02-20 18:44:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2022-02-20 18:44:00,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 967 transitions. [2022-02-20 18:44:00,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 967 edges. 967 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:00,977 INFO L225 Difference]: With dead ends: 1566 [2022-02-20 18:44:00,977 INFO L226 Difference]: Without dead ends: 1101 [2022-02-20 18:44:00,977 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:44:00,979 INFO L933 BasicCegarLoop]: 599 mSDtfsCounter, 366 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:00,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 936 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-02-20 18:44:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1091. [2022-02-20 18:44:01,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:01,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1101 states. Second operand has 1091 states, 1087 states have (on average 1.405703771849126) internal successors, (1528), 1090 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have 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:44:01,365 INFO L74 IsIncluded]: Start isIncluded. First operand 1101 states. Second operand has 1091 states, 1087 states have (on average 1.405703771849126) internal successors, (1528), 1090 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have 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:44:01,366 INFO L87 Difference]: Start difference. First operand 1101 states. Second operand has 1091 states, 1087 states have (on average 1.405703771849126) internal successors, (1528), 1090 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have 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:44:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:01,407 INFO L93 Difference]: Finished difference Result 1101 states and 1536 transitions. [2022-02-20 18:44:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1536 transitions. [2022-02-20 18:44:01,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:01,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:01,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 1091 states, 1087 states have (on average 1.405703771849126) internal successors, (1528), 1090 states have internal predecessors, (1528), 0 states have call successors, (0), 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 1101 states. [2022-02-20 18:44:01,412 INFO L87 Difference]: Start difference. First operand has 1091 states, 1087 states have (on average 1.405703771849126) internal successors, (1528), 1090 states have internal predecessors, (1528), 0 states have call successors, (0), 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 1101 states. [2022-02-20 18:44:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:01,451 INFO L93 Difference]: Finished difference Result 1101 states and 1536 transitions. [2022-02-20 18:44:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1536 transitions. [2022-02-20 18:44:01,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:01,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:01,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:01,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1087 states have (on average 1.405703771849126) internal successors, (1528), 1090 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have 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:44:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1528 transitions. [2022-02-20 18:44:01,504 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1528 transitions. Word has length 51 [2022-02-20 18:44:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:01,504 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 1528 transitions. [2022-02-20 18:44:01,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1528 transitions. [2022-02-20 18:44:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:01,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:01,506 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] [2022-02-20 18:44:01,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:44:01,506 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1979749037, now seen corresponding path program 1 times [2022-02-20 18:44:01,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:01,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575906487] [2022-02-20 18:44:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:01,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {12023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {12023#true} is VALID [2022-02-20 18:44:01,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {12023#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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {12023#true} is VALID [2022-02-20 18:44:01,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {12023#true} assume 0 == ~r1~0 % 256; {12023#true} is VALID [2022-02-20 18:44:01,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {12023#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {12023#true} is VALID [2022-02-20 18:44:01,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {12023#true} assume ~id1~0 >= 0; {12023#true} is VALID [2022-02-20 18:44:01,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {12023#true} assume 0 == ~st1~0; {12023#true} is VALID [2022-02-20 18:44:01,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {12023#true} assume ~send1~0 == ~id1~0; {12023#true} is VALID [2022-02-20 18:44:01,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {12023#true} assume 0 == ~mode1~0 % 256; {12023#true} is VALID [2022-02-20 18:44:01,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {12023#true} assume ~id2~0 >= 0; {12023#true} is VALID [2022-02-20 18:44:01,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {12023#true} assume 0 == ~st2~0; {12023#true} is VALID [2022-02-20 18:44:01,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {12023#true} assume ~send2~0 == ~id2~0; {12023#true} is VALID [2022-02-20 18:44:01,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {12023#true} assume 0 == ~mode2~0 % 256; {12023#true} is VALID [2022-02-20 18:44:01,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {12023#true} assume ~id3~0 >= 0; {12023#true} is VALID [2022-02-20 18:44:01,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {12023#true} assume 0 == ~st3~0; {12023#true} is VALID [2022-02-20 18:44:01,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {12023#true} assume ~send3~0 == ~id3~0; {12023#true} is VALID [2022-02-20 18:44:01,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {12023#true} assume 0 == ~mode3~0 % 256; {12023#true} is VALID [2022-02-20 18:44:01,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {12023#true} assume ~id1~0 != ~id2~0; {12023#true} is VALID [2022-02-20 18:44:01,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {12023#true} assume ~id1~0 != ~id3~0; {12023#true} is VALID [2022-02-20 18:44:01,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {12023#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {12023#true} is VALID [2022-02-20 18:44:01,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {12023#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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {12023#true} is VALID [2022-02-20 18:44:01,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {12023#true} assume !!(0 == ~mode1~0 % 256); {12023#true} is VALID [2022-02-20 18:44:01,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {12023#true} assume !!(0 == ~alive1~0 % 256); {12023#true} is VALID [2022-02-20 18:44:01,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {12023#true} assume !(~send1~0 != ~id1~0); {12023#true} is VALID [2022-02-20 18:44:01,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {12023#true} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {12023#true} is VALID [2022-02-20 18:44:01,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {12023#true} assume !!(0 == ~mode2~0 % 256); {12023#true} is VALID [2022-02-20 18:44:01,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {12023#true} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {12023#true} is VALID [2022-02-20 18:44:01,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {12023#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~3#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~3#1 % 256 else main_~node2____CPAchecker_TMP_0~3#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~14#1;main_~node3__m3~14#1 := ~nomsg~0; {12023#true} is VALID [2022-02-20 18:44:01,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {12023#true} assume !!(0 == ~mode3~0 % 256); {12023#true} is VALID [2022-02-20 18:44:01,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {12023#true} assume !!(0 == ~alive3~0 % 256); {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0);~mode3~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;havoc main_~check__tmp~48#1; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,566 INFO L290 TraceCheckUtils]: 31: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~48#1 := 1;~__return_8224~0 := main_~check__tmp~48#1;main_~main__c1~0#1 := ~__return_8224~0;havoc main_~__tmp_48~0#1;main_~__tmp_48~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~47#1;main_~assert__arg~47#1 := main_~__tmp_48~0#1; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == main_~assert__arg~47#1 % 256); {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode1~0 % 256); {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive2~0 % 256); {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~3#1 != ~nomsg~0; {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:01,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {12025#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {12024#false} is VALID [2022-02-20 18:44:01,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {12024#false} assume !(main_~node3__m3~3#1 > ~id3~0); {12024#false} is VALID [2022-02-20 18:44:01,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {12024#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~5#1; {12024#false} is VALID [2022-02-20 18:44:01,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {12024#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7703~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7703~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {12024#false} is VALID [2022-02-20 18:44:01,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {12024#false} assume 0 == main_~assert__arg~5#1 % 256; {12024#false} is VALID [2022-02-20 18:44:01,575 INFO L290 TraceCheckUtils]: 50: Hoare triple {12024#false} assume !false; {12024#false} is VALID [2022-02-20 18:44:01,577 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:44:01,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:01,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575906487] [2022-02-20 18:44:01,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575906487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:01,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:01,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:01,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010246384] [2022-02-20 18:44:01,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:44:01,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:01,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:01,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:01,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:01,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:01,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:01,608 INFO L87 Difference]: Start difference. First operand 1091 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:02,904 INFO L93 Difference]: Finished difference Result 2383 states and 3421 transitions. [2022-02-20 18:44:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:44:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2022-02-20 18:44:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2022-02-20 18:44:02,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 846 transitions. [2022-02-20 18:44:03,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 846 edges. 846 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:03,491 INFO L225 Difference]: With dead ends: 2383 [2022-02-20 18:44:03,492 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 18:44:03,493 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:44:03,493 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 265 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:03,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 928 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 18:44:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1715. [2022-02-20 18:44:04,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:04,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1715 states, 1711 states have (on average 1.4108708357685564) internal successors, (2414), 1714 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have 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:44:04,103 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1715 states, 1711 states have (on average 1.4108708357685564) internal successors, (2414), 1714 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have 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:44:04,105 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1715 states, 1711 states have (on average 1.4108708357685564) internal successors, (2414), 1714 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have 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:44:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:04,207 INFO L93 Difference]: Finished difference Result 1722 states and 2419 transitions. [2022-02-20 18:44:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2419 transitions. [2022-02-20 18:44:04,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:04,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:04,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 1715 states, 1711 states have (on average 1.4108708357685564) internal successors, (2414), 1714 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1722 states. [2022-02-20 18:44:04,215 INFO L87 Difference]: Start difference. First operand has 1715 states, 1711 states have (on average 1.4108708357685564) internal successors, (2414), 1714 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1722 states. [2022-02-20 18:44:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:04,318 INFO L93 Difference]: Finished difference Result 1722 states and 2419 transitions. [2022-02-20 18:44:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2419 transitions. [2022-02-20 18:44:04,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:04,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:04,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:04,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1711 states have (on average 1.4108708357685564) internal successors, (2414), 1714 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have 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:44:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2414 transitions. [2022-02-20 18:44:04,453 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2414 transitions. Word has length 51 [2022-02-20 18:44:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:04,454 INFO L470 AbstractCegarLoop]: Abstraction has 1715 states and 2414 transitions. [2022-02-20 18:44:04,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2414 transitions. [2022-02-20 18:44:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:44:04,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:04,456 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] [2022-02-20 18:44:04,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:44:04,456 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2124032919, now seen corresponding path program 1 times [2022-02-20 18:44:04,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:04,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480000036] [2022-02-20 18:44:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:04,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:04,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {20825#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {20827#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {20827#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {20827#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {20827#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {20827#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {20827#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {20827#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {20827#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:04,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {20827#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {20828#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:04,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {20828#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {20828#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:04,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {20828#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {20829#(<= (+ ~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~5#1;main_~node2__m2~5#1 := ~nomsg~0; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~3#1; {20829#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:04,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {20829#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~3#1 := ~p2_new~0;~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~3#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~3#1 % 256 else main_~node2____CPAchecker_TMP_0~3#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~14#1;main_~node3__m3~14#1 := ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {20826#false} assume !!(0 == ~mode3~0 % 256); {20826#false} is VALID [2022-02-20 18:44:04,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {20826#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~10#1; {20826#false} is VALID [2022-02-20 18:44:04,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {20826#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~10#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~10#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~10#1 % 256 else main_~node3____CPAchecker_TMP_0~10#1 % 256 - 256);~mode3~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;havoc main_~check__tmp~46#1; {20826#false} is VALID [2022-02-20 18:44:04,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {20826#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {20826#false} is VALID [2022-02-20 18:44:04,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {20826#false} assume ~r1~0 % 256 < 3;main_~check__tmp~46#1 := 1;~__return_8167~0 := main_~check__tmp~46#1;main_~main__c1~0#1 := ~__return_8167~0;havoc main_~__tmp_46~0#1;main_~__tmp_46~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~45#1;main_~assert__arg~45#1 := main_~__tmp_46~0#1; {20826#false} is VALID [2022-02-20 18:44:04,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {20826#false} assume !(0 == main_~assert__arg~45#1 % 256); {20826#false} is VALID [2022-02-20 18:44:04,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {20826#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {20826#false} assume !(0 == ~mode1~0 % 256); {20826#false} is VALID [2022-02-20 18:44:04,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {20826#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {20826#false} assume !(main_~node1__m1~1#1 != ~nomsg~0);~mode1~0 := 0; {20826#false} is VALID [2022-02-20 18:44:04,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {20826#false} havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {20826#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {20826#false} assume main_~node2__m2~1#1 != ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {20826#false} assume !(0 == ~alive2~0 % 256); {20826#false} is VALID [2022-02-20 18:44:04,568 INFO L290 TraceCheckUtils]: 41: Hoare triple {20826#false} assume !(main_~node2__m2~1#1 > ~id2~0); {20826#false} is VALID [2022-02-20 18:44:04,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {20826#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~3#1;main_~node3__m3~3#1 := ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {20826#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~3#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {20826#false} assume main_~node3__m3~3#1 != ~nomsg~0; {20826#false} is VALID [2022-02-20 18:44:04,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {20826#false} assume !(0 == ~alive3~0 % 256); {20826#false} is VALID [2022-02-20 18:44:04,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {20826#false} assume !(main_~node3__m3~3#1 > ~id3~0); {20826#false} is VALID [2022-02-20 18:44:04,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {20826#false} assume main_~node3__m3~3#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~5#1; {20826#false} is VALID [2022-02-20 18:44:04,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {20826#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~5#1 := 0;~__return_7703~0 := main_~check__tmp~5#1;main_~main__c1~0#1 := ~__return_7703~0;havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~5#1;main_~assert__arg~5#1 := main_~__tmp_6~0#1; {20826#false} is VALID [2022-02-20 18:44:04,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {20826#false} assume 0 == main_~assert__arg~5#1 % 256; {20826#false} is VALID [2022-02-20 18:44:04,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {20826#false} assume !false; {20826#false} is VALID [2022-02-20 18:44:04,572 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:44:04,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:04,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480000036] [2022-02-20 18:44:04,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480000036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:04,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:04,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:04,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452656414] [2022-02-20 18:44:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:04,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:44:04,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:04,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:04,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:04,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:04,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:04,601 INFO L87 Difference]: Start difference. First operand 1715 states and 2414 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:07,255 INFO L93 Difference]: Finished difference Result 3784 states and 5391 transitions. [2022-02-20 18:44:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:07,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2022-02-20 18:44:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 922 transitions. [2022-02-20 18:44:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 922 transitions. [2022-02-20 18:44:07,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 922 transitions. [2022-02-20 18:44:07,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 922 edges. 922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:07,979 INFO L225 Difference]: With dead ends: 3784 [2022-02-20 18:44:07,979 INFO L226 Difference]: Without dead ends: 2240 [2022-02-20 18:44:07,980 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:44:07,980 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1539 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:07,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1539 Valid, 371 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2022-02-20 18:44:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2226. [2022-02-20 18:44:09,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:09,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2240 states. Second operand has 2226 states, 2222 states have (on average 1.4185418541854184) internal successors, (3152), 2225 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have 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:44:09,208 INFO L74 IsIncluded]: Start isIncluded. First operand 2240 states. Second operand has 2226 states, 2222 states have (on average 1.4185418541854184) internal successors, (3152), 2225 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have 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:44:09,211 INFO L87 Difference]: Start difference. First operand 2240 states. Second operand has 2226 states, 2222 states have (on average 1.4185418541854184) internal successors, (3152), 2225 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have 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:44:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:09,360 INFO L93 Difference]: Finished difference Result 2240 states and 3164 transitions. [2022-02-20 18:44:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3164 transitions. [2022-02-20 18:44:09,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:09,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:09,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 2226 states, 2222 states have (on average 1.4185418541854184) internal successors, (3152), 2225 states have internal predecessors, (3152), 0 states have call successors, (0), 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 2240 states. [2022-02-20 18:44:09,373 INFO L87 Difference]: Start difference. First operand has 2226 states, 2222 states have (on average 1.4185418541854184) internal successors, (3152), 2225 states have internal predecessors, (3152), 0 states have call successors, (0), 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 2240 states. [2022-02-20 18:44:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:09,524 INFO L93 Difference]: Finished difference Result 2240 states and 3164 transitions. [2022-02-20 18:44:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3164 transitions. [2022-02-20 18:44:09,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:09,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:09,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:09,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2222 states have (on average 1.4185418541854184) internal successors, (3152), 2225 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have 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:44:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 3152 transitions. [2022-02-20 18:44:09,733 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 3152 transitions. Word has length 51 [2022-02-20 18:44:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:09,734 INFO L470 AbstractCegarLoop]: Abstraction has 2226 states and 3152 transitions. [2022-02-20 18:44:09,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:44:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 3152 transitions. [2022-02-20 18:44:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:09,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:09,735 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] [2022-02-20 18:44:09,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:09,735 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:09,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1035105163, now seen corresponding path program 1 times [2022-02-20 18:44:09,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:09,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876199035] [2022-02-20 18:44:09,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:09,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:09,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {33269#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {33271#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {33271#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:09,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {33271#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {33272#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:09,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {33272#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {33272#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:09,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {33272#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {33273#(<= (+ ~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~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); {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {33273#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {33273#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~4#1 := ~p3_new~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~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;havoc main_~check__tmp~22#1; {33270#false} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {33270#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {33270#false} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {33270#false} assume ~r1~0 % 256 < 3;main_~check__tmp~22#1 := 1;~__return_7878~0 := main_~check__tmp~22#1;main_~main__c1~0#1 := ~__return_7878~0;havoc main_~__tmp_22~0#1;main_~__tmp_22~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~21#1;main_~assert__arg~21#1 := main_~__tmp_22~0#1; {33270#false} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {33270#false} assume !(0 == main_~assert__arg~21#1 % 256); {33270#false} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {33270#false} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {33270#false} assume !(0 == ~mode1~0 % 256); {33270#false} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {33270#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {33270#false} assume main_~node1__m1~1#1 != ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {33270#false} assume !(0 == ~alive1~0 % 256); {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {33270#false} assume !(main_~node1__m1~1#1 > ~id1~0); {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {33270#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {33270#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {33270#false} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {33270#false} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {33270#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {33270#false} assume main_~node3__m3~4#1 != ~nomsg~0; {33270#false} is VALID [2022-02-20 18:44:09,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {33270#false} assume !(0 == ~alive3~0 % 256); {33270#false} is VALID [2022-02-20 18:44:09,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {33270#false} assume !(main_~node3__m3~4#1 > ~id3~0); {33270#false} is VALID [2022-02-20 18:44:09,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {33270#false} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~7#1; {33270#false} is VALID [2022-02-20 18:44:09,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {33270#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7021~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7021~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {33270#false} is VALID [2022-02-20 18:44:09,796 INFO L290 TraceCheckUtils]: 50: Hoare triple {33270#false} assume 0 == main_~assert__arg~7#1 % 256; {33270#false} is VALID [2022-02-20 18:44:09,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {33270#false} assume !false; {33270#false} is VALID [2022-02-20 18:44:09,796 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:44:09,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:09,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876199035] [2022-02-20 18:44:09,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876199035] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:09,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:09,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:09,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839529190] [2022-02-20 18:44:09,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:09,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:09,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:09,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:44:09,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:09,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:09,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:09,826 INFO L87 Difference]: Start difference. First operand 2226 states and 3152 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:44:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:14,047 INFO L93 Difference]: Finished difference Result 5039 states and 7185 transitions. [2022-02-20 18:44:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:14,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 18:44:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:44:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2022-02-20 18:44:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:44:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2022-02-20 18:44:14,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 821 transitions. [2022-02-20 18:44:14,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 821 edges. 821 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:14,893 INFO L225 Difference]: With dead ends: 5039 [2022-02-20 18:44:14,893 INFO L226 Difference]: Without dead ends: 2984 [2022-02-20 18:44:14,895 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:44:14,896 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 1382 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:14,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1382 Valid, 340 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2022-02-20 18:44:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2965. [2022-02-20 18:44:17,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:17,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2984 states. Second operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 0 states have call successors, (0), 0 states have 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:44:17,455 INFO L74 IsIncluded]: Start isIncluded. First operand 2984 states. Second operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 0 states have call successors, (0), 0 states have 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:44:17,456 INFO L87 Difference]: Start difference. First operand 2984 states. Second operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 0 states have call successors, (0), 0 states have 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:44:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:17,709 INFO L93 Difference]: Finished difference Result 2984 states and 4206 transitions. [2022-02-20 18:44:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4206 transitions. [2022-02-20 18:44:17,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:17,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:17,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 0 states have call successors, (0), 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 2984 states. [2022-02-20 18:44:17,717 INFO L87 Difference]: Start difference. First operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 0 states have call successors, (0), 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 2984 states. [2022-02-20 18:44:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:17,973 INFO L93 Difference]: Finished difference Result 2984 states and 4206 transitions. [2022-02-20 18:44:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4206 transitions. [2022-02-20 18:44:17,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:17,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:17,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:17,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 0 states have call successors, (0), 0 states have 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:44:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4189 transitions. [2022-02-20 18:44:18,355 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4189 transitions. Word has length 52 [2022-02-20 18:44:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:18,355 INFO L470 AbstractCegarLoop]: Abstraction has 2965 states and 4189 transitions. [2022-02-20 18:44:18,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have 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:44:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4189 transitions. [2022-02-20 18:44:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:18,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:18,357 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] [2022-02-20 18:44:18,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:18,358 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash 825819079, now seen corresponding path program 1 times [2022-02-20 18:44:18,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:18,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812012730] [2022-02-20 18:44:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:18,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {50027#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {50029#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {50029#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {50029#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {50029#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {50029#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {50029#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {50029#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:18,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {50029#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode1~0 % 256; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 >= 0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st2~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send2~0 == ~id2~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode2~0 % 256; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id3~0 >= 0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st3~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send3~0 == ~id3~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~mode3~0 % 256; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id2~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id1~0 != ~id3~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {50030#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {50030#(<= (+ ~nomsg~0 1) ~id1~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode1~0 % 256); {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send1~0 != ~nomsg~0; {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~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); {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode2~0 % 256); {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~send2~0 != ~nomsg~0; {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~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; {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~mode3~0 % 256); {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume !!(0 == ~alive3~0 % 256); {50031#(<= (+ ~p3_new~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {50031#(<= (+ ~p3_new~0 1) ~id1~0)} assume !(~send3~0 != ~id3~0);~mode3~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;havoc main_~check__tmp~12#1; {50032#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {50032#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {50032#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {50032#(<= (+ ~p3_old~0 1) ~id1~0)} assume ~r1~0 % 256 < 3;main_~check__tmp~12#1 := 1;~__return_7801~0 := main_~check__tmp~12#1;main_~main__c1~0#1 := ~__return_7801~0;havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~11#1;main_~assert__arg~11#1 := main_~__tmp_12~0#1; {50032#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {50032#(<= (+ ~p3_old~0 1) ~id1~0)} assume !(0 == main_~assert__arg~11#1 % 256); {50032#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {50032#(<= (+ ~p3_old~0 1) ~id1~0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {50032#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {50032#(<= (+ ~p3_old~0 1) ~id1~0)} assume !(0 == ~mode1~0 % 256); {50032#(<= (+ ~p3_old~0 1) ~id1~0)} is VALID [2022-02-20 18:44:18,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {50032#(<= (+ ~p3_old~0 1) ~id1~0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:18,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:18,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(0 == ~alive1~0 % 256); {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:18,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {50033#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {50028#false} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {50028#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {50028#false} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {50028#false} assume main_~node2__m2~3#1 != ~nomsg~0; {50028#false} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {50028#false} assume !(0 == ~alive2~0 % 256); {50028#false} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {50028#false} assume !(main_~node2__m2~3#1 > ~id2~0); {50028#false} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 46: Hoare triple {50028#false} assume main_~node2__m2~3#1 == ~id2~0;~st2~0 := 1;~mode2~0 := 0;havoc main_~node3__m3~5#1;main_~node3__m3~5#1 := ~nomsg~0; {50028#false} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {50028#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~5#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {50028#false} is VALID [2022-02-20 18:44:18,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {50028#false} assume !(main_~node3__m3~5#1 != ~nomsg~0);~mode3~0 := 0; {50028#false} is VALID [2022-02-20 18:44:18,454 INFO L290 TraceCheckUtils]: 49: Hoare triple {50028#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~8#1; {50028#false} is VALID [2022-02-20 18:44:18,454 INFO L290 TraceCheckUtils]: 50: Hoare triple {50028#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~8#1 := 0;~__return_7555~0 := main_~check__tmp~8#1;main_~main__c1~0#1 := ~__return_7555~0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~8#1;main_~assert__arg~8#1 := main_~__tmp_9~0#1; {50028#false} is VALID [2022-02-20 18:44:18,454 INFO L290 TraceCheckUtils]: 51: Hoare triple {50028#false} assume 0 == main_~assert__arg~8#1 % 256; {50028#false} is VALID [2022-02-20 18:44:18,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {50028#false} assume !false; {50028#false} is VALID [2022-02-20 18:44:18,454 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:44:18,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:18,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812012730] [2022-02-20 18:44:18,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812012730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:18,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:18,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:44:18,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106825744] [2022-02-20 18:44:18,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:18,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:44:18,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:18,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:44:18,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:18,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:44:18,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:44:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:18,489 INFO L87 Difference]: Start difference. First operand 2965 states and 4189 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:44:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:34,508 INFO L93 Difference]: Finished difference Result 9614 states and 13808 transitions. [2022-02-20 18:44:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:44:34,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:44:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:44:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 948 transitions. [2022-02-20 18:44:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:44:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 948 transitions. [2022-02-20 18:44:34,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 948 transitions. [2022-02-20 18:44:35,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 948 edges. 948 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:37,960 INFO L225 Difference]: With dead ends: 9614 [2022-02-20 18:44:37,960 INFO L226 Difference]: Without dead ends: 8311 [2022-02-20 18:44:37,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-02-20 18:44:37,963 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 2747 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2747 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:37,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2747 Valid, 604 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:44:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8311 states. [2022-02-20 18:44:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8311 to 2979. [2022-02-20 18:44:41,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:41,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8311 states. Second operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 0 states have call successors, (0), 0 states have 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:44:41,639 INFO L74 IsIncluded]: Start isIncluded. First operand 8311 states. Second operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 0 states have call successors, (0), 0 states have 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:44:41,641 INFO L87 Difference]: Start difference. First operand 8311 states. Second operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 0 states have call successors, (0), 0 states have 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:44:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:43,830 INFO L93 Difference]: Finished difference Result 8311 states and 11925 transitions. [2022-02-20 18:44:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8311 states and 11925 transitions. [2022-02-20 18:44:43,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:43,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:43,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 0 states have call successors, (0), 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 8311 states. [2022-02-20 18:44:43,857 INFO L87 Difference]: Start difference. First operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 0 states have call successors, (0), 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 8311 states. [2022-02-20 18:44:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:46,126 INFO L93 Difference]: Finished difference Result 8311 states and 11925 transitions. [2022-02-20 18:44:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 8311 states and 11925 transitions. [2022-02-20 18:44:46,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:46,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:46,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:46,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 0 states have call successors, (0), 0 states have 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:44:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4207 transitions. [2022-02-20 18:44:46,513 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4207 transitions. Word has length 53 [2022-02-20 18:44:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:46,514 INFO L470 AbstractCegarLoop]: Abstraction has 2979 states and 4207 transitions. [2022-02-20 18:44:46,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:44:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4207 transitions. [2022-02-20 18:44:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:46,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:46,515 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] [2022-02-20 18:44:46,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:46,516 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 18:44:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1519774840, now seen corresponding path program 1 times [2022-02-20 18:44:46,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:46,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470335119] [2022-02-20 18:44:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:46,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:46,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {84137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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];~__return_6348~0 := 0;~__return_7737~0 := 0;~__return_6487~0 := 0;~__return_6554~0 := 0;~__return_6950~0 := 0;~__return_7472~0 := 0;~__return_7703~0 := 0;~__return_6777~0 := 0;~__return_7021~0 := 0;~__return_7555~0 := 0;~__return_7774~0 := 0;~__return_7666~0 := 0;~__return_7832~0 := 0;~__return_7801~0 := 0;~__return_7506~0 := 0;~__return_7421~0 := 0;~__return_7619~0 := 0;~__return_7588~0 := 0;~__return_8044~0 := 0;~__return_8015~0 := 0;~__return_8103~0 := 0;~__return_8072~0 := 0;~__return_7907~0 := 0;~__return_7878~0 := 0;~__return_7966~0 := 0;~__return_7935~0 := 0;~__return_6984~0 := 0;~__return_6911~0 := 0;~__return_7085~0 := 0;~__return_7054~0 := 0;~__return_6713~0 := 0;~__return_6426~0 := 0;~__return_6864~0 := 0;~__return_6833~0 := 0;~__return_7297~0 := 0;~__return_7268~0 := 0;~__return_7356~0 := 0;~__return_7325~0 := 0;~__return_7160~0 := 0;~__return_7131~0 := 0;~__return_7219~0 := 0;~__return_7188~0 := 0;~__return_8331~0 := 0;~__return_8302~0 := 0;~__return_8390~0 := 0;~__return_8359~0 := 0;~__return_8196~0 := 0;~__return_8167~0 := 0;~__return_8255~0 := 0;~__return_8224~0 := 0;~__return_8602~0 := 0;~__return_8573~0 := 0;~__return_8661~0 := 0;~__return_8630~0 := 0;~__return_8465~0 := 0;~__return_8436~0 := 0;~__return_8524~0 := 0;~__return_8493~0 := 0; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {84139#(<= (+ ~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_~node1____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1__m1~3#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node3__m3~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node3__m3~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node3____CPAchecker_TMP_1~1#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~node3__m3~0#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~13#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~node3____CPAchecker_TMP_0~2#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node3____CPAchecker_TMP_1~2#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~17#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~18#1, main_~node3____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~19#1, main_~node3____CPAchecker_TMP_1~3#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~20#1, main_~node3__m3~7#1, main_~node2____CPAchecker_TMP_1~1#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~21#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~22#1, main_~node3____CPAchecker_TMP_0~4#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~23#1, main_~node3____CPAchecker_TMP_1~4#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~24#1, main_~node3__m3~8#1, main_~node2__m2~0#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~25#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~26#1, main_~node3____CPAchecker_TMP_0~5#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~27#1, main_~node3____CPAchecker_TMP_1~5#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~28#1, main_~node3__m3~9#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~29#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~30#1, main_~node3____CPAchecker_TMP_0~6#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~31#1, main_~node3____CPAchecker_TMP_1~6#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~32#1, main_~node3__m3~10#1, main_~node2____CPAchecker_TMP_0~2#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~33#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~34#1, main_~node3____CPAchecker_TMP_0~7#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~35#1, main_~node3____CPAchecker_TMP_1~7#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~36#1, main_~node3__m3~11#1, main_~node2____CPAchecker_TMP_1~2#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~37#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~38#1, main_~node3____CPAchecker_TMP_0~8#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~39#1, main_~node3____CPAchecker_TMP_1~8#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~40#1, main_~node3__m3~12#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~41#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~42#1, main_~node3____CPAchecker_TMP_0~9#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~43#1, main_~node3____CPAchecker_TMP_1~9#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~44#1, main_~node3__m3~13#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~45#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~46#1, main_~node3____CPAchecker_TMP_0~10#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~47#1, main_~node3____CPAchecker_TMP_1~10#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~48#1, main_~node3__m3~14#1, main_~node2____CPAchecker_TMP_0~3#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~49#1, main_~__tmp_50~0#1, main_~assert__arg~49#1, main_~check__tmp~50#1, main_~node3____CPAchecker_TMP_0~11#1, main_~__tmp_51~0#1, main_~assert__arg~50#1, main_~check__tmp~51#1, main_~node3____CPAchecker_TMP_1~11#1, main_~__tmp_52~0#1, main_~assert__arg~51#1, main_~check__tmp~52#1, main_~node3__m3~15#1, main_~node2____CPAchecker_TMP_1~3#1, main_~__tmp_53~0#1, main_~assert__arg~52#1, main_~check__tmp~53#1, main_~__tmp_54~0#1, main_~assert__arg~53#1, main_~check__tmp~54#1, main_~node3____CPAchecker_TMP_0~12#1, main_~__tmp_55~0#1, main_~assert__arg~54#1, main_~check__tmp~55#1, main_~node3____CPAchecker_TMP_1~12#1, main_~__tmp_56~0#1, main_~assert__arg~55#1, main_~check__tmp~56#1, main_~node3__m3~16#1, main_~node2__m2~5#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {84139#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:46,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {84139#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {84140#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {84140#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {84140#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {84140#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {84140#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {84140#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~mode3~0 % 256; {84140#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {84140#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id2~0; {84140#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {84140#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id1~0 != ~id3~0; {84140#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {84140#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6348~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6348~0; {84140#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {84140#(<= (+ ~nomsg~0 1) ~id3~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;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode1~0 % 256); {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send1~0 != ~nomsg~0; {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~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); {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode2~0 % 256); {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~alive2~0 % 256); {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(~send2~0 != ~id2~0);~mode2~0 := 1;havoc main_~node3__m3~8#1;main_~node3__m3~8#1 := ~nomsg~0; {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume !!(0 == ~mode3~0 % 256); {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~4#1; {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~send3~0 != ~nomsg~0; {84141#(<= (+ ~p2_new~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {84141#(<= (+ ~p2_new~0 1) ~id3~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~4#1 := ~send3~0;~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~4#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~4#1 % 256 else main_~node3____CPAchecker_TMP_0~4#1 % 256 - 256);~mode3~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;havoc main_~check__tmp~21#1; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume ~r1~0 % 256 < 3;main_~check__tmp~21#1 := 1;~__return_7907~0 := main_~check__tmp~21#1;main_~main__c1~0#1 := ~__return_7907~0;havoc main_~__tmp_21~0#1;main_~__tmp_21~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~20#1;main_~assert__arg~20#1 := main_~__tmp_21~0#1; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == main_~assert__arg~20#1 % 256); {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode1~0 % 256); {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~node1__m1~1#1 != ~nomsg~0; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~alive1~0 % 256); {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node1__m1~1#1 > ~id1~0); {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1;~mode1~0 := 0;havoc main_~node2__m2~3#1;main_~node2__m2~3#1 := ~nomsg~0; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~3#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(main_~node2__m2~3#1 != ~nomsg~0);~mode2~0 := 0; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} havoc main_~node3__m3~4#1;main_~node3__m3~4#1 := ~nomsg~0; {84142#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:44:46,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {84142#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~4#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:46,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 != ~nomsg~0; {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:46,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(0 == ~alive3~0 % 256); {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:46,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume !(main_~node3__m3~4#1 > ~id3~0); {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} is VALID [2022-02-20 18:44:46,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {84143#(<= (+ |ULTIMATE.start_main_~node3__m3~4#1| 1) ~id3~0)} assume main_~node3__m3~4#1 == ~id3~0;~st3~0 := 1;~mode3~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;havoc main_~check__tmp~7#1; {84138#false} is VALID [2022-02-20 18:44:46,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {84138#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~7#1 := 0;~__return_7021~0 := main_~check__tmp~7#1;main_~main__c1~0#1 := ~__return_7021~0;havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~7#1;main_~assert__arg~7#1 := main_~__tmp_8~0#1; {84138#false} is VALID [2022-02-20 18:44:46,605 INFO L290 TraceCheckUtils]: 51: Hoare triple {84138#false} assume 0 == main_~assert__arg~7#1 % 256; {84138#false} is VALID [2022-02-20 18:44:46,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {84138#false} assume !false; {84138#false} is VALID [2022-02-20 18:44:46,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:44:46,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:46,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470335119] [2022-02-20 18:44:46,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470335119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:46,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:46,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:44:46,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246144767] [2022-02-20 18:44:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:46,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-02-20 18:44:46,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:46,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:44:46,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:46,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:44:46,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:44:46,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:46,640 INFO L87 Difference]: Start difference. First operand 2979 states and 4207 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)