./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 561889d92df45f99e756a59f568aff549bcbf1af3442520c3f6faf4dbc996ed6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:43,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:43,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:43,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:43,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:43,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:43,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:43,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:43,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:43,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:43,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:43,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:43,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:43,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:43,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:43,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:43,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:43,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:43,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:43,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:43,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:43,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:43,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:43,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:43,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:43,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:43,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:43,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:43,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:43,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:43,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:43,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:43,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:43,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:43,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:43,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:43,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:43,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:43,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:43,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:43,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:43,683 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:50:43,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:43,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:43,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:43,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:43,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:43,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:43,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:43,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:43,708 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:43,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:43,709 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:43,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:43,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:43,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:43,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:43,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:43,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:43,710 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:43,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:43,710 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:43,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:43,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:43,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:43,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:43,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:43,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:43,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:43,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:43,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:43,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:43,713 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:43,713 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:43,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:43,713 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 -> 561889d92df45f99e756a59f568aff549bcbf1af3442520c3f6faf4dbc996ed6 [2022-02-20 18:50:43,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:43,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:43,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:43,938 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:43,938 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:43,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:50:43,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ee01e0b/7330eb8395314c7887a287a6d78dc713/FLAG1b5a93905 [2022-02-20 18:50:44,319 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:44,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:50:44,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ee01e0b/7330eb8395314c7887a287a6d78dc713/FLAG1b5a93905 [2022-02-20 18:50:44,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ee01e0b/7330eb8395314c7887a287a6d78dc713 [2022-02-20 18:50:44,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:44,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:44,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:44,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:44,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:44,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ef7082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:44, skipping insertion in model container [2022-02-20 18:50:44,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:44" (1/1) ... [2022-02-20 18:50:44,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:44,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:44,945 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2022-02-20 18:50:44,969 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2022-02-20 18:50:44,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:44,988 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:45,027 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2022-02-20 18:50:45,034 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2022-02-20 18:50:45,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:45,050 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:45,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45 WrapperNode [2022-02-20 18:50:45,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:45,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:45,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:45,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:45,056 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:50:45" (1/1) ... [2022-02-20 18:50:45,062 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:50:45" (1/1) ... [2022-02-20 18:50:45,099 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 464 [2022-02-20 18:50:45,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:45,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:45,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:45,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:45,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:45,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:45,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:45,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:45,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (1/1) ... [2022-02-20 18:50:45,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:45,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:45,150 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:50:45,157 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:50:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:45,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:45,246 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:45,247 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:45,745 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:45,750 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:45,756 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:45,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:45 BoogieIcfgContainer [2022-02-20 18:50:45,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:45,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:45,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:45,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:45,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:44" (1/3) ... [2022-02-20 18:50:45,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b69f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:45, skipping insertion in model container [2022-02-20 18:50:45,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:45" (2/3) ... [2022-02-20 18:50:45,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b69f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:45, skipping insertion in model container [2022-02-20 18:50:45,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:45" (3/3) ... [2022-02-20 18:50:45,766 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:50:45,771 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:45,771 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 18:50:45,817 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:45,823 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:50:45,824 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 18:50:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have 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:50:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:45,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:45,859 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] [2022-02-20 18:50:45,859 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1038847250, now seen corresponding path program 1 times [2022-02-20 18:50:45,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:45,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717351224] [2022-02-20 18:50:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:46,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {109#true} is VALID [2022-02-20 18:50:46,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {109#true} is VALID [2022-02-20 18:50:46,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume 0 == ~r1~0; {109#true} is VALID [2022-02-20 18:50:46,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} assume ~id1~0 >= 0; {109#true} is VALID [2022-02-20 18:50:46,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {109#true} assume 0 == ~st1~0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#(<= ~st1~0 0)} assume ~id2~0 >= 0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:46,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#(<= ~st1~0 0)} assume 0 == ~st2~0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,123 INFO L290 TraceCheckUtils]: 39: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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~1#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:46,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1712~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1712~0;~__tmp_1617_0~0 := main_~main____CPAchecker_TMP_0~0#1; {110#false} is VALID [2022-02-20 18:50:46,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {110#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1617_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {110#false} is VALID [2022-02-20 18:50:46,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {110#false} assume 0 == main_~assert__arg~2#1 % 256; {110#false} is VALID [2022-02-20 18:50:46,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:50:46,127 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:50:46,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:46,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717351224] [2022-02-20 18:50:46,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717351224] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:46,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:46,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:46,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17047421] [2022-02-20 18:50:46,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:46,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:46,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:50:46,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:46,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:46,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:46,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:46,197 INFO L87 Difference]: Start difference. First operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 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 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:50:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,023 INFO L93 Difference]: Finished difference Result 416 states and 663 transitions. [2022-02-20 18:50:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:50:47,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 18:50:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:50:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2022-02-20 18:50:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:50:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2022-02-20 18:50:47,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 663 transitions. [2022-02-20 18:50:47,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 663 edges. 663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:47,489 INFO L225 Difference]: With dead ends: 416 [2022-02-20 18:50:47,489 INFO L226 Difference]: Without dead ends: 353 [2022-02-20 18:50:47,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:47,494 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 596 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:47,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 768 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-02-20 18:50:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 155. [2022-02-20 18:50:47,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:47,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have 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:50:47,564 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have 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:50:47,565 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have 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:50:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,576 INFO L93 Difference]: Finished difference Result 353 states and 509 transitions. [2022-02-20 18:50:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 509 transitions. [2022-02-20 18:50:47,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 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 353 states. [2022-02-20 18:50:47,579 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 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 353 states. [2022-02-20 18:50:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,589 INFO L93 Difference]: Finished difference Result 353 states and 509 transitions. [2022-02-20 18:50:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 509 transitions. [2022-02-20 18:50:47,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:47,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have 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:50:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2022-02-20 18:50:47,596 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 48 [2022-02-20 18:50:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:47,596 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2022-02-20 18:50:47,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:50:47,596 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2022-02-20 18:50:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:47,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:47,597 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] [2022-02-20 18:50:47,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:47,598 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1964840261, now seen corresponding path program 1 times [2022-02-20 18:50:47,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:47,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559339582] [2022-02-20 18:50:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:47,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {1572#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {1572#true} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1572#true} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} assume 0 == ~r1~0; {1572#true} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {1572#true} assume ~id1~0 >= 0; {1572#true} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {1572#true} assume 0 == ~st1~0; {1572#true} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#true} assume ~send1~0 == ~id1~0; {1572#true} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {1572#true} assume 0 == ~mode1~0 % 256; {1572#true} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#true} assume ~id2~0 >= 0; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#true} assume 0 == ~st2~0; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#true} assume ~send2~0 == ~id2~0; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {1572#true} assume 0 == ~mode2~0 % 256; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#true} assume ~id3~0 >= 0; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {1572#true} assume 0 == ~st3~0; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#true} assume ~send3~0 == ~id3~0; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#true} assume 0 == ~mode3~0 % 256; {1572#true} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {1572#true} assume ~id1~0 != ~id2~0; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#true} assume ~id1~0 != ~id3~0; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {1572#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#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; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {1572#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {1572#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1572#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {1572#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1572#true} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {1572#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1572#true} is VALID [2022-02-20 18:50:47,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {1572#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1572#true} is VALID [2022-02-20 18:50:47,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {1572#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1572#true} is VALID [2022-02-20 18:50:47,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {1572#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {1572#true} is VALID [2022-02-20 18:50:47,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {1572#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {1572#true} is VALID [2022-02-20 18:50:47,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {1572#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1572#true} is VALID [2022-02-20 18:50:47,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#true} assume !(~r1~0 >= 3); {1572#true} is VALID [2022-02-20 18:50:47,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {1572#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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~1#1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:47,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {1573#false} is VALID [2022-02-20 18:50:47,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {1573#false} assume 0 == main_~assert__arg~3#1 % 256; {1573#false} is VALID [2022-02-20 18:50:47,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {1573#false} assume !false; {1573#false} is VALID [2022-02-20 18:50:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:47,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:47,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559339582] [2022-02-20 18:50:47,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559339582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:47,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:47,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:47,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119155193] [2022-02-20 18:50:47,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:50:47,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:47,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:50:47,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:47,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:47,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:47,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:47,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:47,753 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:50:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,983 INFO L93 Difference]: Finished difference Result 244 states and 352 transitions. [2022-02-20 18:50:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:47,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-02-20 18:50:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:50:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2022-02-20 18:50:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:50:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2022-02-20 18:50:47,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 290 transitions. [2022-02-20 18:50:48,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:48,174 INFO L225 Difference]: With dead ends: 244 [2022-02-20 18:50:48,174 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 18:50:48,175 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:50:48,176 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:48,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 301 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 18:50:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-02-20 18:50:48,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:48,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:50:48,215 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:50:48,216 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:50:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,219 INFO L93 Difference]: Finished difference Result 159 states and 221 transitions. [2022-02-20 18:50:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2022-02-20 18:50:48,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:48,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:48,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 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 159 states. [2022-02-20 18:50:48,220 INFO L87 Difference]: Start difference. First operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 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 159 states. [2022-02-20 18:50:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,223 INFO L93 Difference]: Finished difference Result 159 states and 221 transitions. [2022-02-20 18:50:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2022-02-20 18:50:48,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:48,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:48,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:48,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:50:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 220 transitions. [2022-02-20 18:50:48,227 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 220 transitions. Word has length 49 [2022-02-20 18:50:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:48,228 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 220 transitions. [2022-02-20 18:50:48,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have 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:50:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 220 transitions. [2022-02-20 18:50:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:48,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:48,229 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:50:48,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:48,229 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1398279763, now seen corresponding path program 1 times [2022-02-20 18:50:48,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:48,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829587010] [2022-02-20 18:50:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:48,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {2410#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {2410#true} is VALID [2022-02-20 18:50:48,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2410#true} is VALID [2022-02-20 18:50:48,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {2410#true} assume 0 == ~r1~0; {2410#true} is VALID [2022-02-20 18:50:48,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {2410#true} assume ~id1~0 >= 0; {2410#true} is VALID [2022-02-20 18:50:48,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {2410#true} assume 0 == ~st1~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {2412#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {2412#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~st2~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {2412#(<= ~st1~0 0)} assume ~id3~0 >= 0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:48,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~st3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:48,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:48,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:48,347 INFO L290 TraceCheckUtils]: 43: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:48,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:48,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~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~1#1; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:48,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1712~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1712~0;~__tmp_1617_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2411#false} is VALID [2022-02-20 18:50:48,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {2411#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1617_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {2411#false} is VALID [2022-02-20 18:50:48,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {2411#false} assume 0 == main_~assert__arg~2#1 % 256; {2411#false} is VALID [2022-02-20 18:50:48,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-02-20 18:50:48,350 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:50:48,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:48,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829587010] [2022-02-20 18:50:48,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829587010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:48,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:48,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:48,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535840062] [2022-02-20 18:50:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:48,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:48,352 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), 5 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:50:48,384 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:50:48,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:48,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:48,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:48,386 INFO L87 Difference]: Start difference. First operand 157 states and 220 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:48,910 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2022-02-20 18:50:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:48,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-02-20 18:50:49,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,204 INFO L225 Difference]: With dead ends: 470 [2022-02-20 18:50:49,204 INFO L226 Difference]: Without dead ends: 388 [2022-02-20 18:50:49,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:49,206 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 299 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:49,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 532 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-02-20 18:50:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 248. [2022-02-20 18:50:49,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:49,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:50:49,325 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:50:49,325 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:50:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,342 INFO L93 Difference]: Finished difference Result 388 states and 562 transitions. [2022-02-20 18:50:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 562 transitions. [2022-02-20 18:50:49,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 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 388 states. [2022-02-20 18:50:49,344 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 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 388 states. [2022-02-20 18:50:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,353 INFO L93 Difference]: Finished difference Result 388 states and 562 transitions. [2022-02-20 18:50:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 562 transitions. [2022-02-20 18:50:49,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:49,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:49,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:49,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:50:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 359 transitions. [2022-02-20 18:50:49,359 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 359 transitions. Word has length 50 [2022-02-20 18:50:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:49,359 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 359 transitions. [2022-02-20 18:50:49,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 359 transitions. [2022-02-20 18:50:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:49,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:49,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:49,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:49,361 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1526101883, now seen corresponding path program 1 times [2022-02-20 18:50:49,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:49,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912926078] [2022-02-20 18:50:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:49,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {4147#true} is VALID [2022-02-20 18:50:49,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {4147#true} is VALID [2022-02-20 18:50:49,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} assume 0 == ~r1~0; {4147#true} is VALID [2022-02-20 18:50:49,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {4147#true} assume ~id1~0 >= 0; {4147#true} is VALID [2022-02-20 18:50:49,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {4147#true} assume 0 == ~st1~0; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:49,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {4149#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:49,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {4149#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:49,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {4149#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:49,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {4149#(<= ~st1~0 0)} assume 0 == ~st2~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:49,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:49,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~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~1#1; {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:49,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1712~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1712~0;~__tmp_1617_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4148#false} is VALID [2022-02-20 18:50:49,435 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1617_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {4148#false} is VALID [2022-02-20 18:50:49,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#false} assume 0 == main_~assert__arg~2#1 % 256; {4148#false} is VALID [2022-02-20 18:50:49,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#false} assume !false; {4148#false} is VALID [2022-02-20 18:50:49,436 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:50:49,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:49,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912926078] [2022-02-20 18:50:49,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912926078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:49,437 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:49,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:49,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527229443] [2022-02-20 18:50:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:49,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:49,438 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), 5 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:50:49,468 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:50:49,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:49,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:49,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:49,469 INFO L87 Difference]: Start difference. First operand 248 states and 359 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,029 INFO L93 Difference]: Finished difference Result 556 states and 821 transitions. [2022-02-20 18:50:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:50,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:50,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-02-20 18:50:50,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,316 INFO L225 Difference]: With dead ends: 556 [2022-02-20 18:50:50,316 INFO L226 Difference]: Without dead ends: 474 [2022-02-20 18:50:50,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:50,318 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 357 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:50,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 537 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-02-20 18:50:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 376. [2022-02-20 18:50:50,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:50,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:50:50,498 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:50:50,499 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:50:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,508 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2022-02-20 18:50:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 693 transitions. [2022-02-20 18:50:50,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 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 474 states. [2022-02-20 18:50:50,510 INFO L87 Difference]: Start difference. First operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 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 474 states. [2022-02-20 18:50:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,520 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2022-02-20 18:50:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 693 transitions. [2022-02-20 18:50:50,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:50,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:50:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 553 transitions. [2022-02-20 18:50:50,528 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 553 transitions. Word has length 50 [2022-02-20 18:50:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:50,529 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 553 transitions. [2022-02-20 18:50:50,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 553 transitions. [2022-02-20 18:50:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:50,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:50,530 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:50:50,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:50,530 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:50,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2031133031, now seen corresponding path program 1 times [2022-02-20 18:50:50,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:50,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276933285] [2022-02-20 18:50:50,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:50,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {6352#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {6352#true} is VALID [2022-02-20 18:50:50,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {6352#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {6352#true} is VALID [2022-02-20 18:50:50,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {6352#true} assume 0 == ~r1~0; {6352#true} is VALID [2022-02-20 18:50:50,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {6352#true} assume ~id1~0 >= 0; {6352#true} is VALID [2022-02-20 18:50:50,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {6352#true} assume 0 == ~st1~0; {6352#true} is VALID [2022-02-20 18:50:50,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {6352#true} assume ~send1~0 == ~id1~0; {6352#true} is VALID [2022-02-20 18:50:50,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {6352#true} assume 0 == ~mode1~0 % 256; {6352#true} is VALID [2022-02-20 18:50:50,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {6352#true} assume ~id2~0 >= 0; {6352#true} is VALID [2022-02-20 18:50:50,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {6352#true} assume 0 == ~st2~0; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:50,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {6354#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:50,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {6354#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:50,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {6354#(<= ~st2~0 0)} assume ~id3~0 >= 0; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:50,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {6354#(<= ~st2~0 0)} assume 0 == ~st3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 3); {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:50,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~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~1#1; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:50,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1712~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1712~0;~__tmp_1617_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6353#false} is VALID [2022-02-20 18:50:50,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {6353#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1617_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {6353#false} is VALID [2022-02-20 18:50:50,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {6353#false} assume 0 == main_~assert__arg~2#1 % 256; {6353#false} is VALID [2022-02-20 18:50:50,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {6353#false} assume !false; {6353#false} is VALID [2022-02-20 18:50:50,643 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:50:50,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:50,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276933285] [2022-02-20 18:50:50,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276933285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:50,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:50,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:50,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411080593] [2022-02-20 18:50:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:50,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:50,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:50,644 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), 5 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:50:50,675 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:50:50,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:50,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:50,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:50,676 INFO L87 Difference]: Start difference. First operand 376 states and 553 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,361 INFO L93 Difference]: Finished difference Result 647 states and 960 transitions. [2022-02-20 18:50:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:51,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:51,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-02-20 18:50:51,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:51,667 INFO L225 Difference]: With dead ends: 647 [2022-02-20 18:50:51,667 INFO L226 Difference]: Without dead ends: 565 [2022-02-20 18:50:51,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:51,668 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 362 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:51,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 550 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-02-20 18:50:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 467. [2022-02-20 18:50:51,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:51,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 565 states. Second operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have 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:50:51,957 INFO L74 IsIncluded]: Start isIncluded. First operand 565 states. Second operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have 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:50:51,958 INFO L87 Difference]: Start difference. First operand 565 states. Second operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have 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:50:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,969 INFO L93 Difference]: Finished difference Result 565 states and 832 transitions. [2022-02-20 18:50:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 832 transitions. [2022-02-20 18:50:51,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 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 565 states. [2022-02-20 18:50:51,971 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 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 565 states. [2022-02-20 18:50:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,982 INFO L93 Difference]: Finished difference Result 565 states and 832 transitions. [2022-02-20 18:50:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 832 transitions. [2022-02-20 18:50:51,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:51,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:51,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:51,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have 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:50:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 692 transitions. [2022-02-20 18:50:51,994 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 692 transitions. Word has length 50 [2022-02-20 18:50:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:51,994 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 692 transitions. [2022-02-20 18:50:51,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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:50:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 692 transitions. [2022-02-20 18:50:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:51,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:51,995 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:50:51,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:51,995 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash 222346276, now seen corresponding path program 1 times [2022-02-20 18:50:51,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:51,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721572056] [2022-02-20 18:50:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:51,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:52,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {8989#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {8991#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:52,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {8991#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:52,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {8991#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:52,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {8991#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {8992#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:52,095 INFO L290 TraceCheckUtils]: 4: Hoare triple {8992#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {8992#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:52,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {8992#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {8993#(<= (+ ~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; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:52,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {8990#false} is VALID [2022-02-20 18:50:52,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {8990#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {8990#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8990#false} is VALID [2022-02-20 18:50:52,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {8990#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {8990#false} is VALID [2022-02-20 18:50:52,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {8990#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {8990#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8990#false} is VALID [2022-02-20 18:50:52,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {8990#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {8990#false} is VALID [2022-02-20 18:50:52,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {8990#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {8990#false} is VALID [2022-02-20 18:50:52,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {8990#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8990#false} is VALID [2022-02-20 18:50:52,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {8990#false} assume !(~r1~0 >= 3); {8990#false} is VALID [2022-02-20 18:50:52,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {8990#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {8990#false} is VALID [2022-02-20 18:50:52,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {8990#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {8990#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {8990#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {8990#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {8990#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {8990#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {8990#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {8990#false} assume main_~node2__m2~1#1 != ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {8990#false} assume !(main_~node2__m2~1#1 > ~id2~0); {8990#false} is VALID [2022-02-20 18:50:52,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {8990#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {8990#false} is VALID [2022-02-20 18:50:52,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {8990#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {8990#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:52,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {8990#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {8990#false} is VALID [2022-02-20 18:50:52,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {8990#false} ~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~1#1; {8990#false} is VALID [2022-02-20 18:50:52,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {8990#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8990#false} is VALID [2022-02-20 18:50:52,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {8990#false} assume !(~r1~0 >= 3); {8990#false} is VALID [2022-02-20 18:50:52,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {8990#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {8990#false} is VALID [2022-02-20 18:50:52,116 INFO L290 TraceCheckUtils]: 49: Hoare triple {8990#false} assume 0 == main_~assert__arg~3#1 % 256; {8990#false} is VALID [2022-02-20 18:50:52,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {8990#false} assume !false; {8990#false} is VALID [2022-02-20 18:50:52,116 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:50:52,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:52,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721572056] [2022-02-20 18:50:52,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721572056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:52,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:52,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:52,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130364199] [2022-02-20 18:50:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:52,118 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:50:52,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:52,118 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:50:52,148 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:50:52,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:52,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:52,149 INFO L87 Difference]: Start difference. First operand 467 states and 692 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:50:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:52,847 INFO L93 Difference]: Finished difference Result 911 states and 1360 transitions. [2022-02-20 18:50:52,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:52,847 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:50:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:52,847 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:50:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2022-02-20 18:50:52,848 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:50:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2022-02-20 18:50:52,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 254 transitions. [2022-02-20 18:50:53,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:53,013 INFO L225 Difference]: With dead ends: 911 [2022-02-20 18:50:53,013 INFO L226 Difference]: Without dead ends: 467 [2022-02-20 18:50:53,013 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:50:53,014 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 376 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:53,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 80 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-02-20 18:50:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2022-02-20 18:50:53,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:53,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4666666666666666) internal successors, (682), 466 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have 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:50:53,399 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4666666666666666) internal successors, (682), 466 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have 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:50:53,400 INFO L87 Difference]: Start difference. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4666666666666666) internal successors, (682), 466 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have 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:50:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,409 INFO L93 Difference]: Finished difference Result 467 states and 682 transitions. [2022-02-20 18:50:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 682 transitions. [2022-02-20 18:50:53,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4666666666666666) internal successors, (682), 466 states have internal predecessors, (682), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:50:53,411 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4666666666666666) internal successors, (682), 466 states have internal predecessors, (682), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:50:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,419 INFO L93 Difference]: Finished difference Result 467 states and 682 transitions. [2022-02-20 18:50:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 682 transitions. [2022-02-20 18:50:53,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:53,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4666666666666666) internal successors, (682), 466 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have 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:50:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 682 transitions. [2022-02-20 18:50:53,446 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 682 transitions. Word has length 51 [2022-02-20 18:50:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:53,447 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 682 transitions. [2022-02-20 18:50:53,447 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:50:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 682 transitions. [2022-02-20 18:50:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:53,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:53,448 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:50:53,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:53,448 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:53,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash 323435980, now seen corresponding path program 1 times [2022-02-20 18:50:53,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:53,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527634990] [2022-02-20 18:50:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:53,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {11786#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {11788#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:53,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {11788#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {11788#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:53,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {11788#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {11788#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:53,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {11788#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {11788#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:53,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {11788#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {11788#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:53,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {11788#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {11788#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:53,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {11788#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {11788#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:53,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {11788#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {11789#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:53,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {11789#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {11789#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:53,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {11789#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {11790#(<= (+ ~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; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11790#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {11790#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {11787#false} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {11787#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {11787#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11787#false} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {11787#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {11787#false} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {11787#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {11787#false} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {11787#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11787#false} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {11787#false} assume !(~r1~0 >= 3); {11787#false} is VALID [2022-02-20 18:50:53,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {11787#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {11787#false} is VALID [2022-02-20 18:50:53,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {11787#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {11787#false} is VALID [2022-02-20 18:50:53,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {11787#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {11787#false} is VALID [2022-02-20 18:50:53,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {11787#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {11787#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {11787#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {11787#false} is VALID [2022-02-20 18:50:53,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {11787#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {11787#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {11787#false} assume main_~node2__m2~1#1 != ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {11787#false} assume !(main_~node2__m2~1#1 > ~id2~0); {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {11787#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {11787#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {11787#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {11787#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {11787#false} ~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~1#1; {11787#false} is VALID [2022-02-20 18:50:53,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {11787#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11787#false} is VALID [2022-02-20 18:50:53,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {11787#false} assume !(~r1~0 >= 3); {11787#false} is VALID [2022-02-20 18:50:53,534 INFO L290 TraceCheckUtils]: 49: Hoare triple {11787#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {11787#false} is VALID [2022-02-20 18:50:53,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {11787#false} assume 0 == main_~assert__arg~3#1 % 256; {11787#false} is VALID [2022-02-20 18:50:53,534 INFO L290 TraceCheckUtils]: 51: Hoare triple {11787#false} assume !false; {11787#false} is VALID [2022-02-20 18:50:53,534 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:50:53,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:53,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527634990] [2022-02-20 18:50:53,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527634990] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:53,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:53,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:53,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929874785] [2022-02-20 18:50:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:53,536 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:50:53,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:53,536 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:50:53,563 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:50:53,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:53,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:53,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:53,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:53,564 INFO L87 Difference]: Start difference. First operand 467 states and 682 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:50:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:54,426 INFO L93 Difference]: Finished difference Result 907 states and 1336 transitions. [2022-02-20 18:50:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:54,427 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:50:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:54,427 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:50:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2022-02-20 18:50:54,428 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:50:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2022-02-20 18:50:54,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 246 transitions. [2022-02-20 18:50:54,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,605 INFO L225 Difference]: With dead ends: 907 [2022-02-20 18:50:54,606 INFO L226 Difference]: Without dead ends: 467 [2022-02-20 18:50:54,606 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:50:54,607 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 358 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:54,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 88 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-02-20 18:50:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2022-02-20 18:50:55,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:55,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4451612903225806) internal successors, (672), 466 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have 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:50:55,292 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4451612903225806) internal successors, (672), 466 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have 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:50:55,292 INFO L87 Difference]: Start difference. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4451612903225806) internal successors, (672), 466 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have 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:50:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,300 INFO L93 Difference]: Finished difference Result 467 states and 672 transitions. [2022-02-20 18:50:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 672 transitions. [2022-02-20 18:50:55,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4451612903225806) internal successors, (672), 466 states have internal predecessors, (672), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:50:55,302 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4451612903225806) internal successors, (672), 466 states have internal predecessors, (672), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:50:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,310 INFO L93 Difference]: Finished difference Result 467 states and 672 transitions. [2022-02-20 18:50:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 672 transitions. [2022-02-20 18:50:55,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:55,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:55,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:55,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4451612903225806) internal successors, (672), 466 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have 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:50:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 672 transitions. [2022-02-20 18:50:55,321 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 672 transitions. Word has length 52 [2022-02-20 18:50:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:55,321 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 672 transitions. [2022-02-20 18:50:55,321 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:50:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 672 transitions. [2022-02-20 18:50:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:50:55,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:55,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:55,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:55,323 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash 549255064, now seen corresponding path program 1 times [2022-02-20 18:50:55,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:55,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623528383] [2022-02-20 18:50:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:55,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {14578#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {14580#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {14580#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:55,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {14580#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {14581#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:55,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {14581#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {14581#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:55,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {14581#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {14582#(<= (+ ~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; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14582#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:55,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {14582#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {14579#false} is VALID [2022-02-20 18:50:55,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {14579#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {14579#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {14579#false} assume !(~r1~0 >= 3); {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {14579#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {14579#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {14579#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {14579#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {14579#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14579#false} is VALID [2022-02-20 18:50:55,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {14579#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {14579#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {14579#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {14579#false} assume main_~node2__m2~1#1 != ~nomsg~0; {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {14579#false} assume !(main_~node2__m2~1#1 > ~id2~0); {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {14579#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {14579#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {14579#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14579#false} is VALID [2022-02-20 18:50:55,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {14579#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {14579#false} is VALID [2022-02-20 18:50:55,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {14579#false} ~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~1#1; {14579#false} is VALID [2022-02-20 18:50:55,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {14579#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14579#false} is VALID [2022-02-20 18:50:55,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {14579#false} assume !(~r1~0 >= 3); {14579#false} is VALID [2022-02-20 18:50:55,391 INFO L290 TraceCheckUtils]: 50: Hoare triple {14579#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {14579#false} is VALID [2022-02-20 18:50:55,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {14579#false} assume 0 == main_~assert__arg~3#1 % 256; {14579#false} is VALID [2022-02-20 18:50:55,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {14579#false} assume !false; {14579#false} is VALID [2022-02-20 18:50:55,391 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:50:55,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:55,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623528383] [2022-02-20 18:50:55,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623528383] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:55,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:55,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:55,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214465976] [2022-02-20 18:50:55,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:55,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:50:55,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:55,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:50:55,424 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:50:55,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:55,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:55,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:55,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:55,425 INFO L87 Difference]: Start difference. First operand 467 states and 672 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:50:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:56,371 INFO L93 Difference]: Finished difference Result 903 states and 1312 transitions. [2022-02-20 18:50:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:50:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:50:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2022-02-20 18:50:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:50:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2022-02-20 18:50:56,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 238 transitions. [2022-02-20 18:50:56,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:56,523 INFO L225 Difference]: With dead ends: 903 [2022-02-20 18:50:56,523 INFO L226 Difference]: Without dead ends: 467 [2022-02-20 18:50:56,524 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:50:56,525 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 340 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:56,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 96 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-02-20 18:50:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2022-02-20 18:50:57,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:57,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 466 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:50:57,192 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 466 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:50:57,193 INFO L87 Difference]: Start difference. First operand 467 states. Second operand has 467 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 466 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:50:57,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,201 INFO L93 Difference]: Finished difference Result 467 states and 662 transitions. [2022-02-20 18:50:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 662 transitions. [2022-02-20 18:50:57,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 466 states have internal predecessors, (662), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:50:57,203 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 466 states have internal predecessors, (662), 0 states have call successors, (0), 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 467 states. [2022-02-20 18:50:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:57,211 INFO L93 Difference]: Finished difference Result 467 states and 662 transitions. [2022-02-20 18:50:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 662 transitions. [2022-02-20 18:50:57,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:57,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:57,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:57,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 466 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have 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:50:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 662 transitions. [2022-02-20 18:50:57,223 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 662 transitions. Word has length 53 [2022-02-20 18:50:57,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:57,223 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 662 transitions. [2022-02-20 18:50:57,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 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:50:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 662 transitions. [2022-02-20 18:50:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:50:57,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:57,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:57,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:57,224 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash -680909608, now seen corresponding path program 1 times [2022-02-20 18:50:57,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:57,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955298200] [2022-02-20 18:50:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:57,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {17365#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {17367#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:57,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {17367#(<= (+ ~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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {17368#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {17369#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {17369#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {17369#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:57,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {17369#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 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; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:57,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {17370#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {17371#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:50:57,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {17371#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 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; {17372#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:57,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {17372#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {17372#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:57,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {17372#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~send3~0 != ~nomsg~0; {17372#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:57,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {17372#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {17373#(or (and (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256))) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256)) (- 256)) ~p2_new~0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 1) |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} is VALID [2022-02-20 18:50:57,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {17373#(or (and (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256))) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256)) (- 256)) ~p2_new~0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 1) |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:57,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:57,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(~r1~0 >= 3); {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:57,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:57,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:57,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:57,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:57,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {17374#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {17375#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} is VALID [2022-02-20 18:50:57,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {17375#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {17376#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {17376#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {17376#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {17376#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {17376#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {17376#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {17376#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {17376#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {17376#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,508 INFO L290 TraceCheckUtils]: 44: Hoare triple {17376#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {17376#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {17376#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {17376#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:57,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {17376#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {17377#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:50:57,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {17377#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {17366#false} is VALID [2022-02-20 18:50:57,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {17366#false} ~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~1#1; {17366#false} is VALID [2022-02-20 18:50:57,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {17366#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17366#false} is VALID [2022-02-20 18:50:57,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {17366#false} assume !(~r1~0 >= 3); {17366#false} is VALID [2022-02-20 18:50:57,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {17366#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {17366#false} is VALID [2022-02-20 18:50:57,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {17366#false} assume 0 == main_~assert__arg~3#1 % 256; {17366#false} is VALID [2022-02-20 18:50:57,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {17366#false} assume !false; {17366#false} is VALID [2022-02-20 18:50:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:57,510 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:57,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955298200] [2022-02-20 18:50:57,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955298200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:57,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:57,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:57,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222778387] [2022-02-20 18:50:57,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:57,511 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:50:57,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:57,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:50:57,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:57,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:50:57,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:50:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:50:57,547 INFO L87 Difference]: Start difference. First operand 467 states and 662 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,955 INFO L93 Difference]: Finished difference Result 1273 states and 1820 transitions. [2022-02-20 18:51:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:00,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:51:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 287 transitions. [2022-02-20 18:51:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 287 transitions. [2022-02-20 18:51:00,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 287 transitions. [2022-02-20 18:51:01,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:01,212 INFO L225 Difference]: With dead ends: 1273 [2022-02-20 18:51:01,213 INFO L226 Difference]: Without dead ends: 884 [2022-02-20 18:51:01,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:51:01,216 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 976 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:01,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [976 Valid, 368 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-02-20 18:51:01,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 467. [2022-02-20 18:51:01,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:01,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 884 states. Second operand has 467 states, 465 states have (on average 1.4150537634408602) internal successors, (658), 466 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,920 INFO L74 IsIncluded]: Start isIncluded. First operand 884 states. Second operand has 467 states, 465 states have (on average 1.4150537634408602) internal successors, (658), 466 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,920 INFO L87 Difference]: Start difference. First operand 884 states. Second operand has 467 states, 465 states have (on average 1.4150537634408602) internal successors, (658), 466 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,945 INFO L93 Difference]: Finished difference Result 884 states and 1252 transitions. [2022-02-20 18:51:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1252 transitions. [2022-02-20 18:51:01,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:01,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:01,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4150537634408602) internal successors, (658), 466 states have internal predecessors, (658), 0 states have call successors, (0), 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 884 states. [2022-02-20 18:51:01,947 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4150537634408602) internal successors, (658), 466 states have internal predecessors, (658), 0 states have call successors, (0), 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 884 states. [2022-02-20 18:51:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:01,971 INFO L93 Difference]: Finished difference Result 884 states and 1252 transitions. [2022-02-20 18:51:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1252 transitions. [2022-02-20 18:51:01,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:01,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:01,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:01,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4150537634408602) internal successors, (658), 466 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 658 transitions. [2022-02-20 18:51:01,982 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 658 transitions. Word has length 54 [2022-02-20 18:51:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:01,982 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 658 transitions. [2022-02-20 18:51:01,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 658 transitions. [2022-02-20 18:51:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:01,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:01,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:01,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:01,984 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:01,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1013391184, now seen corresponding path program 1 times [2022-02-20 18:51:01,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:01,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651154716] [2022-02-20 18:51:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:02,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {21544#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {21546#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:02,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {21546#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} 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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~r1~0; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 >= 0; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st1~0; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 == ~id1~0; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode1~0 % 256; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 >= 0; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st2~0; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 == ~id2~0; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:51:02,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {21547#(and (<= ~id3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {21548#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {21548#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {21548#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:02,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {21548#(and (<= (+ ~nomsg~0 1) ~id3~0) (<= ~id3~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume 0 == ~mode3~0 % 256; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id2~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id1~0 != ~id3~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~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; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send1~0 != ~nomsg~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send2~0 != ~nomsg~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~send3~0 != ~nomsg~0; {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} is VALID [2022-02-20 18:51:02,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {21549#(and (<= ~send3~0 (+ ~nomsg~0 128)) (<= (+ ~nomsg~0 1) ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {21550#(and (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0))) (or (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} is VALID [2022-02-20 18:51:02,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {21550#(and (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0))) (or (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {21551#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:02,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {21551#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21551#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:02,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {21551#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 3); {21551#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:02,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {21551#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {21551#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:02,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {21551#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {21551#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:02,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {21551#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {21551#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:02,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {21551#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {21551#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:02,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {21551#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {21552#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:02,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {21552#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {21545#false} is VALID [2022-02-20 18:51:02,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {21545#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {21545#false} is VALID [2022-02-20 18:51:02,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {21545#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {21545#false} is VALID [2022-02-20 18:51:02,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {21545#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {21545#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {21545#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {21545#false} assume main_~node3__m3~1#1 != ~nomsg~0; {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {21545#false} assume !(main_~node3__m3~1#1 > ~id3~0); {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {21545#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 48: Hoare triple {21545#false} ~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~1#1; {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {21545#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {21545#false} is VALID [2022-02-20 18:51:02,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {21545#false} assume !(~r1~0 >= 3); {21545#false} is VALID [2022-02-20 18:51:02,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {21545#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {21545#false} is VALID [2022-02-20 18:51:02,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {21545#false} assume 0 == main_~assert__arg~3#1 % 256; {21545#false} is VALID [2022-02-20 18:51:02,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {21545#false} assume !false; {21545#false} is VALID [2022-02-20 18:51:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:02,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:02,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651154716] [2022-02-20 18:51:02,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651154716] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:02,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:02,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:02,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021971708] [2022-02-20 18:51:02,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:02,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:51:02,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:02,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:02,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:02,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:02,165 INFO L87 Difference]: Start difference. First operand 467 states and 658 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:04,917 INFO L93 Difference]: Finished difference Result 1260 states and 1804 transitions. [2022-02-20 18:51:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:51:04,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-02-20 18:51:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 291 transitions. [2022-02-20 18:51:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 291 transitions. [2022-02-20 18:51:04,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 291 transitions. [2022-02-20 18:51:05,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:05,156 INFO L225 Difference]: With dead ends: 1260 [2022-02-20 18:51:05,157 INFO L226 Difference]: Without dead ends: 856 [2022-02-20 18:51:05,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:51:05,158 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 973 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:05,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [973 Valid, 237 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-02-20 18:51:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 467. [2022-02-20 18:51:06,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:06,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 856 states. Second operand has 467 states, 465 states have (on average 1.4129032258064516) internal successors, (657), 466 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,022 INFO L74 IsIncluded]: Start isIncluded. First operand 856 states. Second operand has 467 states, 465 states have (on average 1.4129032258064516) internal successors, (657), 466 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,023 INFO L87 Difference]: Start difference. First operand 856 states. Second operand has 467 states, 465 states have (on average 1.4129032258064516) internal successors, (657), 466 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:06,045 INFO L93 Difference]: Finished difference Result 856 states and 1219 transitions. [2022-02-20 18:51:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1219 transitions. [2022-02-20 18:51:06,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:06,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:06,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4129032258064516) internal successors, (657), 466 states have internal predecessors, (657), 0 states have call successors, (0), 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 856 states. [2022-02-20 18:51:06,047 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4129032258064516) internal successors, (657), 466 states have internal predecessors, (657), 0 states have call successors, (0), 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 856 states. [2022-02-20 18:51:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:06,070 INFO L93 Difference]: Finished difference Result 856 states and 1219 transitions. [2022-02-20 18:51:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1219 transitions. [2022-02-20 18:51:06,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:06,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:06,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:06,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4129032258064516) internal successors, (657), 466 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 657 transitions. [2022-02-20 18:51:06,080 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 657 transitions. Word has length 54 [2022-02-20 18:51:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:06,080 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 657 transitions. [2022-02-20 18:51:06,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 657 transitions. [2022-02-20 18:51:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:06,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:06,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:06,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:06,082 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2026548830, now seen corresponding path program 1 times [2022-02-20 18:51:06,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:06,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518047258] [2022-02-20 18:51:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:06,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {25625#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {25627#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:06,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {25627#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} 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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {25628#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {25628#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {25628#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {25628#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {25629#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {25629#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {25629#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {25629#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} 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; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:06,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {25630#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {25631#(and (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 256 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127))))} is VALID [2022-02-20 18:51:06,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {25631#(and (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 256 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127))))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {25632#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:51:06,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {25632#(not (= ~nomsg~0 ~p1_new~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {25633#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:06,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {25633#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {25634#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:06,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {25634#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {25626#false} is VALID [2022-02-20 18:51:06,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {25626#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {25626#false} is VALID [2022-02-20 18:51:06,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {25626#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {25626#false} assume main_~node3__m3~1#1 != ~nomsg~0; {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {25626#false} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {25626#false} ~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~1#1; {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 50: Hoare triple {25626#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 51: Hoare triple {25626#false} assume !(~r1~0 >= 3); {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {25626#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {25626#false} assume 0 == main_~assert__arg~3#1 % 256; {25626#false} is VALID [2022-02-20 18:51:06,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {25626#false} assume !false; {25626#false} is VALID [2022-02-20 18:51:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:06,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:06,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518047258] [2022-02-20 18:51:06,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518047258] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:06,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:06,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:51:06,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860483717] [2022-02-20 18:51:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:06,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:51:06,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:06,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:06,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:06,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:51:06,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:06,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:51:06,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:51:06,307 INFO L87 Difference]: Start difference. First operand 467 states and 657 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,689 INFO L93 Difference]: Finished difference Result 1288 states and 1835 transitions. [2022-02-20 18:51:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:09,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 18:51:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 299 transitions. [2022-02-20 18:51:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 299 transitions. [2022-02-20 18:51:09,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 299 transitions. [2022-02-20 18:51:09,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,950 INFO L225 Difference]: With dead ends: 1288 [2022-02-20 18:51:09,950 INFO L226 Difference]: Without dead ends: 889 [2022-02-20 18:51:09,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:51:09,952 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 891 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:09,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [891 Valid, 388 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:51:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-02-20 18:51:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 467. [2022-02-20 18:51:11,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:11,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 889 states. Second operand has 467 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 466 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,516 INFO L74 IsIncluded]: Start isIncluded. First operand 889 states. Second operand has 467 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 466 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,516 INFO L87 Difference]: Start difference. First operand 889 states. Second operand has 467 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 466 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:11,541 INFO L93 Difference]: Finished difference Result 889 states and 1256 transitions. [2022-02-20 18:51:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1256 transitions. [2022-02-20 18:51:11,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:11,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:11,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 466 states have internal predecessors, (655), 0 states have call successors, (0), 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 889 states. [2022-02-20 18:51:11,543 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 466 states have internal predecessors, (655), 0 states have call successors, (0), 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 889 states. [2022-02-20 18:51:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:11,567 INFO L93 Difference]: Finished difference Result 889 states and 1256 transitions. [2022-02-20 18:51:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1256 transitions. [2022-02-20 18:51:11,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:11,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:11,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:11,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 466 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 655 transitions. [2022-02-20 18:51:11,577 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 655 transitions. Word has length 55 [2022-02-20 18:51:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:11,578 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 655 transitions. [2022-02-20 18:51:11,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 655 transitions. [2022-02-20 18:51:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:51:11,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:11,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:11,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:11,579 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2014195720, now seen corresponding path program 1 times [2022-02-20 18:51:11,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:11,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200430692] [2022-02-20 18:51:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:11,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {29829#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {29829#true} is VALID [2022-02-20 18:51:11,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {29829#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {29831#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {29831#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {29831#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:51:11,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {29831#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {29832#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:11,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {29832#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {29832#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:11,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {29832#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {29833#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {29833#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode1~0 % 256; {29833#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {29833#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 >= 0; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st2~0; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send2~0 == ~id2~0; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode2~0 % 256; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id3~0 >= 0; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st3~0; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send3~0 == ~id3~0; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode3~0 % 256; {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {29834#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id2~0; {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id3~0; {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~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; {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send1~0 != ~nomsg~0; {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:51:11,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {29835#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {29836#(and (or (and (or (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ ~id2~0 127))) (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0)))) (not (<= ~id2~0 ~id1~0))) (or (and (or (<= ~id2~0 (+ 127 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (or (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| ~id1~0) (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:11,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {29836#(and (or (and (or (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ ~id2~0 127))) (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0)))) (not (<= ~id2~0 ~id1~0))) (or (and (or (<= ~id2~0 (+ 127 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (or (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| ~id1~0) (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~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; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {29837#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(~r1~0 >= 3); {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~node1__m1~1#1 != ~nomsg~0; {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(main_~node1__m1~1#1 > ~id1~0); {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:51:11,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {29838#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {29839#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {29839#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {29839#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:11,981 INFO L290 TraceCheckUtils]: 43: Hoare triple {29839#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {29840#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:11,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {29840#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume main_~node2__m2~1#1 != ~nomsg~0; {29840#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:11,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {29840#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 > ~id2~0); {29841#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:51:11,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {29841#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {29830#false} is VALID [2022-02-20 18:51:11,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {29830#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {29830#false} is VALID [2022-02-20 18:51:11,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {29830#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {29830#false} is VALID [2022-02-20 18:51:11,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {29830#false} assume main_~node3__m3~1#1 != ~nomsg~0; {29830#false} is VALID [2022-02-20 18:51:11,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {29830#false} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {29830#false} is VALID [2022-02-20 18:51:11,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {29830#false} ~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~1#1; {29830#false} is VALID [2022-02-20 18:51:11,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {29830#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1712~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1712~0;~__tmp_1617_0~0 := main_~main____CPAchecker_TMP_0~0#1; {29830#false} is VALID [2022-02-20 18:51:11,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {29830#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1617_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {29830#false} is VALID [2022-02-20 18:51:11,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {29830#false} assume 0 == main_~assert__arg~2#1 % 256; {29830#false} is VALID [2022-02-20 18:51:11,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {29830#false} assume !false; {29830#false} is VALID [2022-02-20 18:51:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:11,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:11,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200430692] [2022-02-20 18:51:11,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200430692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:11,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:11,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 18:51:11,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570015016] [2022-02-20 18:51:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:11,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:11,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:51:12,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:12,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:51:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:51:12,028 INFO L87 Difference]: Start difference. First operand 467 states and 655 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:21,048 INFO L93 Difference]: Finished difference Result 1806 states and 2594 transitions. [2022-02-20 18:51:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 451 transitions. [2022-02-20 18:51:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 451 transitions. [2022-02-20 18:51:21,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 451 transitions. [2022-02-20 18:51:21,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:21,510 INFO L225 Difference]: With dead ends: 1806 [2022-02-20 18:51:21,511 INFO L226 Difference]: Without dead ends: 1619 [2022-02-20 18:51:21,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:51:21,512 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 1171 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:21,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 1149 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-02-20 18:51:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 451. [2022-02-20 18:51:23,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:23,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1619 states. Second operand has 451 states, 449 states have (on average 1.4075723830734967) internal successors, (632), 450 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,107 INFO L74 IsIncluded]: Start isIncluded. First operand 1619 states. Second operand has 451 states, 449 states have (on average 1.4075723830734967) internal successors, (632), 450 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,107 INFO L87 Difference]: Start difference. First operand 1619 states. Second operand has 451 states, 449 states have (on average 1.4075723830734967) internal successors, (632), 450 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,183 INFO L93 Difference]: Finished difference Result 1619 states and 2322 transitions. [2022-02-20 18:51:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2322 transitions. [2022-02-20 18:51:23,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 451 states, 449 states have (on average 1.4075723830734967) internal successors, (632), 450 states have internal predecessors, (632), 0 states have call successors, (0), 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 1619 states. [2022-02-20 18:51:23,186 INFO L87 Difference]: Start difference. First operand has 451 states, 449 states have (on average 1.4075723830734967) internal successors, (632), 450 states have internal predecessors, (632), 0 states have call successors, (0), 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 1619 states. [2022-02-20 18:51:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,259 INFO L93 Difference]: Finished difference Result 1619 states and 2322 transitions. [2022-02-20 18:51:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2322 transitions. [2022-02-20 18:51:23,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:23,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 449 states have (on average 1.4075723830734967) internal successors, (632), 450 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 632 transitions. [2022-02-20 18:51:23,270 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 632 transitions. Word has length 56 [2022-02-20 18:51:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:23,270 INFO L470 AbstractCegarLoop]: Abstraction has 451 states and 632 transitions. [2022-02-20 18:51:23,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 632 transitions. [2022-02-20 18:51:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:51:23,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:23,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:23,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:23,271 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1797287643, now seen corresponding path program 1 times [2022-02-20 18:51:23,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:23,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264081967] [2022-02-20 18:51:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:23,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:23,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {36187#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {36187#true} is VALID [2022-02-20 18:51:23,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {36187#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {36189#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:23,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {36189#(<= ~send1~0 127)} assume 0 == ~r1~0; {36189#(<= ~send1~0 127)} is VALID [2022-02-20 18:51:23,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {36189#(<= ~send1~0 127)} assume ~id1~0 >= 0; {36190#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:23,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {36190#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume 0 == ~st1~0; {36190#(and (<= 0 ~id1~0) (<= ~send1~0 127))} is VALID [2022-02-20 18:51:23,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {36190#(and (<= 0 ~id1~0) (<= ~send1~0 127))} assume ~send1~0 == ~id1~0; {36191#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {36191#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {36191#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {36191#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {36192#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {36192#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {36192#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {36192#(and (<= ~id1~0 127) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {36193#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {36193#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {36193#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {36193#(and (<= 0 ~send2~0) (<= ~id1~0 127) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {36194#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {36194#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {36194#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {36194#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:23,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {36195#(and (<= 0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {36196#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:51:23,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {36196#(and (<= 0 ~id3~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send2~0) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {36197#(and (or (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= 0 ~send2~0))} is VALID [2022-02-20 18:51:23,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {36197#(and (or (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= 0 ~send2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {36197#(and (or (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= 0 ~send2~0))} is VALID [2022-02-20 18:51:23,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {36197#(and (or (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= 0 ~send2~0))} assume ~send2~0 != ~nomsg~0; {36197#(and (or (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= 0 ~send2~0))} is VALID [2022-02-20 18:51:23,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {36197#(and (or (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~id3~0) (<= 0 ~send2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {36198#(and (<= 0 ~id3~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:51:23,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {36198#(and (<= 0 ~id3~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (and (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)))) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 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; {36199#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:23,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {36199#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {36199#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:23,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {36199#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume ~send3~0 != ~nomsg~0; {36199#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} is VALID [2022-02-20 18:51:23,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {36199#(or (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ ~send3~0 127)) (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0))))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {36200#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (or (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127))))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:51:23,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {36200#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (or (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (and (<= (+ ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id1~0 (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127))))) (<= (+ ~p1_new~0 1) ~id2~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 >= 3); {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {36201#(or (<= (+ ~id1~0 129) ~p3_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {36202#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {36202#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {36202#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {36202#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {36203#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {36203#(or (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {36204#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {36204#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {36204#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:23,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {36204#(or (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p1_old~0 ~p2_old~0) (+ ~id3~0 ~id2~0)))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {36205#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {36205#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {36205#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:23,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {36205#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0) (+ ~id3~0 ~id2~0)) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {36206#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:23,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {36206#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {36206#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:23,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {36206#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {36207#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:23,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {36207#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 != ~nomsg~0; {36207#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:23,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {36207#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {36188#false} is VALID [2022-02-20 18:51:23,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {36188#false} ~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~1#1; {36188#false} is VALID [2022-02-20 18:51:23,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {36188#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {36188#false} is VALID [2022-02-20 18:51:23,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {36188#false} assume !(~r1~0 >= 3); {36188#false} is VALID [2022-02-20 18:51:23,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {36188#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {36188#false} is VALID [2022-02-20 18:51:23,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {36188#false} assume 0 == main_~assert__arg~3#1 % 256; {36188#false} is VALID [2022-02-20 18:51:23,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {36188#false} assume !false; {36188#false} is VALID [2022-02-20 18:51:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:23,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:23,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264081967] [2022-02-20 18:51:23,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264081967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:23,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:23,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 18:51:23,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966823449] [2022-02-20 18:51:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:23,866 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:23,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:23,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:23,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:51:23,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:51:23,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:23,914 INFO L87 Difference]: Start difference. First operand 451 states and 632 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:41,874 INFO L93 Difference]: Finished difference Result 2494 states and 3594 transitions. [2022-02-20 18:51:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 18:51:41,874 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 660 transitions. [2022-02-20 18:51:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 660 transitions. [2022-02-20 18:51:41,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 660 transitions. [2022-02-20 18:51:42,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:42,592 INFO L225 Difference]: With dead ends: 2494 [2022-02-20 18:51:42,592 INFO L226 Difference]: Without dead ends: 2317 [2022-02-20 18:51:42,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 18:51:42,593 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 1247 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 3757 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:42,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1247 Valid, 3757 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 18:51:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2022-02-20 18:51:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 456. [2022-02-20 18:51:44,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:44,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2317 states. Second operand has 456 states, 454 states have (on average 1.4030837004405285) internal successors, (637), 455 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,563 INFO L74 IsIncluded]: Start isIncluded. First operand 2317 states. Second operand has 456 states, 454 states have (on average 1.4030837004405285) internal successors, (637), 455 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,563 INFO L87 Difference]: Start difference. First operand 2317 states. Second operand has 456 states, 454 states have (on average 1.4030837004405285) internal successors, (637), 455 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,726 INFO L93 Difference]: Finished difference Result 2317 states and 3337 transitions. [2022-02-20 18:51:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3337 transitions. [2022-02-20 18:51:44,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 456 states, 454 states have (on average 1.4030837004405285) internal successors, (637), 455 states have internal predecessors, (637), 0 states have call successors, (0), 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 2317 states. [2022-02-20 18:51:44,729 INFO L87 Difference]: Start difference. First operand has 456 states, 454 states have (on average 1.4030837004405285) internal successors, (637), 455 states have internal predecessors, (637), 0 states have call successors, (0), 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 2317 states. [2022-02-20 18:51:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:44,869 INFO L93 Difference]: Finished difference Result 2317 states and 3337 transitions. [2022-02-20 18:51:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3337 transitions. [2022-02-20 18:51:44,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:44,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:44,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:44,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 454 states have (on average 1.4030837004405285) internal successors, (637), 455 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 637 transitions. [2022-02-20 18:51:44,882 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 637 transitions. Word has length 56 [2022-02-20 18:51:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:44,882 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 637 transitions. [2022-02-20 18:51:44,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 637 transitions. [2022-02-20 18:51:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:51:44,883 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:44,883 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:44,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 18:51:44,883 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1026982439, now seen corresponding path program 1 times [2022-02-20 18:51:44,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:44,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73987279] [2022-02-20 18:51:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:45,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {44923#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(48, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~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_1406~0 := 0;~__return_1479~0 := 0;~__return_1546~0 := 0;~__tmp_1555_0~0 := 0;~__return_1616~0 := 0;~__tmp_1617_0~0 := 0;~__return_1559~0 := 0;~__return_1693~0 := 0;~__return_1712~0 := 0; {44923#true} is VALID [2022-02-20 18:51:45,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {44923#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_~main____CPAchecker_TMP_0~2#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__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {44925#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:45,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {44925#(<= ~id3~0 127)} assume 0 == ~r1~0; {44925#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:45,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {44925#(<= ~id3~0 127)} assume ~id1~0 >= 0; {44926#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:45,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {44926#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {44926#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:45,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {44926#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {44927#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {44927#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {44927#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {44927#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {44928#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {44928#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {44928#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {44928#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {44929#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {44929#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {44929#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {44929#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {44930#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {44930#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {44930#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {44930#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1406~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1406~0; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:45,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {44931#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {44932#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:45,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {44932#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0)) (<= 0 ~send3~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {44933#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} is VALID [2022-02-20 18:51:45,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {44933#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {44933#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} is VALID [2022-02-20 18:51:45,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {44933#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} assume ~send2~0 != ~nomsg~0; {44933#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} is VALID [2022-02-20 18:51:45,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {44933#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {44934#(and (<= 0 ~id3~0) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (<= ~id3~0 (+ |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127)) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0))))} is VALID [2022-02-20 18:51:45,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {44934#(and (<= 0 ~id3~0) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (<= ~id3~0 (+ |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127)) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 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; {44935#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:45,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {44935#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {44935#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:45,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {44935#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {44935#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:45,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {44935#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {44936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:45,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {44936#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~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~0#1; {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:45,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:45,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 >= 3); {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:45,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:45,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1479~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1479~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:45,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:45,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:45,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {44937#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {44938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {44938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {44938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {44938#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {44939#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {44939#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {44939#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {44939#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {44940#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {44940#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {44940#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {44940#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {44941#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {44941#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {44941#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:45,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {44941#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {44942#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:45,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {44942#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {44942#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:45,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {44942#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {44943#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:45,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {44943#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {44924#false} is VALID [2022-02-20 18:51:45,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {44924#false} ~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~1#1; {44924#false} is VALID [2022-02-20 18:51:45,431 INFO L290 TraceCheckUtils]: 51: Hoare triple {44924#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {44924#false} is VALID [2022-02-20 18:51:45,431 INFO L290 TraceCheckUtils]: 52: Hoare triple {44924#false} assume !(~r1~0 >= 3); {44924#false} is VALID [2022-02-20 18:51:45,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {44924#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1693~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1693~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {44924#false} is VALID [2022-02-20 18:51:45,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {44924#false} assume 0 == main_~assert__arg~3#1 % 256; {44924#false} is VALID [2022-02-20 18:51:45,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {44924#false} assume !false; {44924#false} is VALID [2022-02-20 18:51:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:45,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:45,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73987279] [2022-02-20 18:51:45,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73987279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:45,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:45,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 18:51:45,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384531485] [2022-02-20 18:51:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:51:45,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:45,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:45,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:45,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:51:45,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:45,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:51:45,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:45,463 INFO L87 Difference]: Start difference. First operand 456 states and 637 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)