./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.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-var-start-time.5.2.ufo.BOUNDED-10.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 6a475a1757f9d6a7e4fb14b3de484172261c724bb5d3b2a10ee5c8f5de9de51b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:48:10,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:48:10,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:48:10,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:48:10,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:48:10,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:48:10,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:48:10,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:48:10,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:48:10,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:48:10,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:48:10,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:48:10,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:48:10,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:48:10,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:48:10,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:48:10,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:48:10,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:48:10,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:48:10,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:48:10,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:48:10,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:48:10,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:48:10,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:48:10,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:48:10,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:48:10,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:48:10,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:48:10,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:48:10,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:48:10,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:48:10,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:48:10,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:48:10,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:48:10,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:48:10,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:48:10,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:48:10,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:48:10,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:48:10,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:48:10,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:48:10,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:48:10,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:48:10,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:48:10,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:48:10,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:48:10,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:48:10,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:48:10,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:48:10,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:48:10,799 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:48:10,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:48:10,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:48:10,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:48:10,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:48:10,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:48:10,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:48:10,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:48:10,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:48:10,801 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:48:10,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:48:10,801 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:48:10,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:48:10,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:48:10,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:48:10,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:48:10,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:10,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:48:10,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:48:10,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:48:10,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:48:10,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:48:10,804 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:48:10,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:48:10,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:48:10,804 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 -> 6a475a1757f9d6a7e4fb14b3de484172261c724bb5d3b2a10ee5c8f5de9de51b [2022-02-20 18:48:11,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:48:11,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:48:11,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:48:11,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:48:11,050 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:48:11,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:48:11,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89fad8d6/1728524dc405472bad5fb5156647decd/FLAG42c1463ef [2022-02-20 18:48:11,571 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:48:11,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:48:11,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89fad8d6/1728524dc405472bad5fb5156647decd/FLAG42c1463ef [2022-02-20 18:48:11,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89fad8d6/1728524dc405472bad5fb5156647decd [2022-02-20 18:48:11,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:48:11,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:48:11,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:11,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:48:11,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:48:11,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:11" (1/1) ... [2022-02-20 18:48:11,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91c3c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:11, skipping insertion in model container [2022-02-20 18:48:11,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:48:11" (1/1) ... [2022-02-20 18:48:11,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:48:11,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:48:12,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2022-02-20 18:48:12,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:12,212 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:48:12,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2022-02-20 18:48:12,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:48:12,309 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:48:12,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12 WrapperNode [2022-02-20 18:48:12,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:48:12,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:12,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:48:12,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:48:12,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,359 INFO L137 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 779 [2022-02-20 18:48:12,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:48:12,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:48:12,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:48:12,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:48:12,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:48:12,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:48:12,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:48:12,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:48:12,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (1/1) ... [2022-02-20 18:48:12,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:48:12,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:48:12,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:48:12,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:48:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:48:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:48:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:48:12,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:48:12,566 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:48:12,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:48:13,122 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:48:13,133 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:48:13,133 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:48:13,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:13 BoogieIcfgContainer [2022-02-20 18:48:13,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:48:13,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:48:13,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:48:13,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:48:13,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:48:11" (1/3) ... [2022-02-20 18:48:13,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5418c518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:13, skipping insertion in model container [2022-02-20 18:48:13,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:48:12" (2/3) ... [2022-02-20 18:48:13,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5418c518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:48:13, skipping insertion in model container [2022-02-20 18:48:13,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:48:13" (3/3) ... [2022-02-20 18:48:13,143 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2022-02-20 18:48:13,146 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:48:13,148 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:48:13,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:48:13,194 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:48:13,194 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:48:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 205 states have (on average 1.721951219512195) internal successors, (353), 206 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:48:13,246 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:13,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:13,247 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -374161539, now seen corresponding path program 1 times [2022-02-20 18:48:13,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:13,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12337497] [2022-02-20 18:48:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:13,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#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(66, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33017~0 := 0;~__return_33136~0 := 0;~__tmp_33297_0~0 := 0;~__return_33329~0 := 0;~__return_33342~0 := 0; {210#true} is VALID [2022-02-20 18:48:13,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {210#true} is VALID [2022-02-20 18:48:13,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume 0 == ~r1~0; {210#true} is VALID [2022-02-20 18:48:13,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {210#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {210#true} is VALID [2022-02-20 18:48:13,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {210#true} assume ~id1~0 >= 0; {210#true} is VALID [2022-02-20 18:48:13,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} assume 0 == ~st1~0; {212#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:13,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {212#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {212#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:13,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {212#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {212#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:13,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#(<= ~st1~0 0)} assume ~id2~0 >= 0; {212#(<= ~st1~0 0)} is VALID [2022-02-20 18:48:13,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {212#(<= ~st1~0 0)} assume 0 == ~st2~0; {213#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {213#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {213#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {213#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {214#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {215#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33017~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33017~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,690 INFO L290 TraceCheckUtils]: 39: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,694 INFO L290 TraceCheckUtils]: 47: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,698 INFO L290 TraceCheckUtils]: 50: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,698 INFO L290 TraceCheckUtils]: 51: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive5~0 % 256); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,702 INFO L290 TraceCheckUtils]: 55: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_33136~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33136~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; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,707 INFO L290 TraceCheckUtils]: 63: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,712 INFO L290 TraceCheckUtils]: 68: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,713 INFO L290 TraceCheckUtils]: 70: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0;~__tmp_33297_0~0 := main_~main____CPAchecker_TMP_0~0#1; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,713 INFO L290 TraceCheckUtils]: 71: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_33297_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:48:13,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {216#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);main_~check__tmp~1#1 := 0; {211#false} is VALID [2022-02-20 18:48:13,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {211#false} ~__return_33329~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33329~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {211#false} is VALID [2022-02-20 18:48:13,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {211#false} assume 0 == main_~assert__arg~1#1 % 256; {211#false} is VALID [2022-02-20 18:48:13,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {211#false} assume !false; {211#false} is VALID [2022-02-20 18:48:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:13,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:13,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12337497] [2022-02-20 18:48:13,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12337497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:13,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:13,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:48:13,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511779650] [2022-02-20 18:48:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:48:13,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:13,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:13,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:13,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:48:13,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:13,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:48:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:13,805 INFO L87 Difference]: Start difference. First operand has 207 states, 205 states have (on average 1.721951219512195) internal successors, (353), 206 states have internal predecessors, (353), 0 states have call successors, (0), 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 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:15,945 INFO L93 Difference]: Finished difference Result 829 states and 1341 transitions. [2022-02-20 18:48:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:48:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2022-02-20 18:48:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1341 transitions. [2022-02-20 18:48:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1341 transitions. [2022-02-20 18:48:15,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1341 transitions. [2022-02-20 18:48:16,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1341 edges. 1341 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:16,892 INFO L225 Difference]: With dead ends: 829 [2022-02-20 18:48:16,893 INFO L226 Difference]: Without dead ends: 714 [2022-02-20 18:48:16,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:48:16,898 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 2307 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:16,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2307 Valid, 2437 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-02-20 18:48:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 315. [2022-02-20 18:48:17,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:17,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,045 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,045 INFO L87 Difference]: Start difference. First operand 714 states. Second operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:17,067 INFO L93 Difference]: Finished difference Result 714 states and 1100 transitions. [2022-02-20 18:48:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1100 transitions. [2022-02-20 18:48:17,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:17,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:17,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 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 714 states. [2022-02-20 18:48:17,071 INFO L87 Difference]: Start difference. First operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 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 714 states. [2022-02-20 18:48:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:17,092 INFO L93 Difference]: Finished difference Result 714 states and 1100 transitions. [2022-02-20 18:48:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1100 transitions. [2022-02-20 18:48:17,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:17,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:17,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:17,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2022-02-20 18:48:17,102 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 80 [2022-02-20 18:48:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:17,103 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2022-02-20 18:48:17,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2022-02-20 18:48:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:48:17,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:17,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:17,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:48:17,105 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:17,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1024475534, now seen corresponding path program 1 times [2022-02-20 18:48:17,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:17,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681516328] [2022-02-20 18:48:17,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:17,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {3172#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(66, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33017~0 := 0;~__return_33136~0 := 0;~__tmp_33297_0~0 := 0;~__return_33329~0 := 0;~__return_33342~0 := 0; {3172#true} is VALID [2022-02-20 18:48:17,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {3172#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {3172#true} is VALID [2022-02-20 18:48:17,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {3172#true} assume 0 == ~r1~0; {3172#true} is VALID [2022-02-20 18:48:17,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {3172#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33017~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33017~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~mode1~0 % 256); {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID [2022-02-20 18:48:17,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {3174#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !!(0 == ~alive1~0 % 256); {3175#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:17,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {3175#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3175#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:17,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {3175#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~mode2~0 % 256); {3175#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID [2022-02-20 18:48:17,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {3175#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !!(0 == ~alive2~0 % 256); {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:17,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:17,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:17,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~mode3~0 % 256); {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID [2022-02-20 18:48:17,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {3176#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !!(0 == ~alive3~0 % 256); {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:17,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:17,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:17,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:48:17,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {3177#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:17,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:17,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:17,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~mode5~0 % 256); {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:48:17,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {3178#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~alive5~0 % 256); {3173#false} is VALID [2022-02-20 18:48:17,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {3173#false} assume !(~send5~0 != ~id5~0); {3173#false} is VALID [2022-02-20 18:48:17,326 INFO L290 TraceCheckUtils]: 54: Hoare triple {3173#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3173#false} is VALID [2022-02-20 18:48:17,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {3173#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3173#false} is VALID [2022-02-20 18:48:17,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {3173#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_33136~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33136~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; {3173#false} is VALID [2022-02-20 18:48:17,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {3173#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; {3173#false} is VALID [2022-02-20 18:48:17,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {3173#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {3173#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {3173#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3173#false} is VALID [2022-02-20 18:48:17,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {3173#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {3173#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {3173#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3173#false} is VALID [2022-02-20 18:48:17,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {3173#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {3173#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {3173#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {3173#false} is VALID [2022-02-20 18:48:17,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {3173#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,333 INFO L290 TraceCheckUtils]: 68: Hoare triple {3173#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,333 INFO L290 TraceCheckUtils]: 69: Hoare triple {3173#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3173#false} is VALID [2022-02-20 18:48:17,333 INFO L290 TraceCheckUtils]: 70: Hoare triple {3173#false} ~mode4~0 := 0;~__tmp_33297_0~0 := main_~main____CPAchecker_TMP_0~0#1; {3173#false} is VALID [2022-02-20 18:48:17,333 INFO L290 TraceCheckUtils]: 71: Hoare triple {3173#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_33297_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,333 INFO L290 TraceCheckUtils]: 72: Hoare triple {3173#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3173#false} is VALID [2022-02-20 18:48:17,333 INFO L290 TraceCheckUtils]: 73: Hoare triple {3173#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3173#false} is VALID [2022-02-20 18:48:17,334 INFO L290 TraceCheckUtils]: 74: Hoare triple {3173#false} ~mode5~0 := 0; {3173#false} is VALID [2022-02-20 18:48:17,334 INFO L290 TraceCheckUtils]: 75: Hoare triple {3173#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {3173#false} is VALID [2022-02-20 18:48:17,334 INFO L290 TraceCheckUtils]: 76: Hoare triple {3173#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3173#false} is VALID [2022-02-20 18:48:17,334 INFO L290 TraceCheckUtils]: 77: Hoare triple {3173#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {3173#false} is VALID [2022-02-20 18:48:17,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {3173#false} ~__return_33329~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33329~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {3173#false} is VALID [2022-02-20 18:48:17,334 INFO L290 TraceCheckUtils]: 79: Hoare triple {3173#false} assume 0 == main_~assert__arg~1#1 % 256; {3173#false} is VALID [2022-02-20 18:48:17,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {3173#false} assume !false; {3173#false} is VALID [2022-02-20 18:48:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:17,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:17,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681516328] [2022-02-20 18:48:17,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681516328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:17,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:17,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:48:17,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624256519] [2022-02-20 18:48:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:48:17,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:17,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:17,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:17,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:48:17,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:48:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:17,403 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:19,913 INFO L93 Difference]: Finished difference Result 1371 states and 2113 transitions. [2022-02-20 18:48:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:48:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2022-02-20 18:48:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions. [2022-02-20 18:48:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions. [2022-02-20 18:48:19,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1207 transitions. [2022-02-20 18:48:20,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:20,749 INFO L225 Difference]: With dead ends: 1371 [2022-02-20 18:48:20,749 INFO L226 Difference]: Without dead ends: 1133 [2022-02-20 18:48:20,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:48:20,756 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 1456 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:20,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1456 Valid, 1440 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:48:20,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-02-20 18:48:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1125. [2022-02-20 18:48:21,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:21,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1133 states. Second operand has 1125 states, 1124 states have (on average 1.5364768683274022) internal successors, (1727), 1124 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:21,364 INFO L74 IsIncluded]: Start isIncluded. First operand 1133 states. Second operand has 1125 states, 1124 states have (on average 1.5364768683274022) internal successors, (1727), 1124 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:21,366 INFO L87 Difference]: Start difference. First operand 1133 states. Second operand has 1125 states, 1124 states have (on average 1.5364768683274022) internal successors, (1727), 1124 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:21,455 INFO L93 Difference]: Finished difference Result 1133 states and 1731 transitions. [2022-02-20 18:48:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1731 transitions. [2022-02-20 18:48:21,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:21,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:21,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 1125 states, 1124 states have (on average 1.5364768683274022) internal successors, (1727), 1124 states have internal predecessors, (1727), 0 states have call successors, (0), 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 1133 states. [2022-02-20 18:48:21,462 INFO L87 Difference]: Start difference. First operand has 1125 states, 1124 states have (on average 1.5364768683274022) internal successors, (1727), 1124 states have internal predecessors, (1727), 0 states have call successors, (0), 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 1133 states. [2022-02-20 18:48:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:21,534 INFO L93 Difference]: Finished difference Result 1133 states and 1731 transitions. [2022-02-20 18:48:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1731 transitions. [2022-02-20 18:48:21,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:21,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:21,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:21,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.5364768683274022) internal successors, (1727), 1124 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1727 transitions. [2022-02-20 18:48:21,588 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1727 transitions. Word has length 81 [2022-02-20 18:48:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:21,590 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1727 transitions. [2022-02-20 18:48:21,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:21,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1727 transitions. [2022-02-20 18:48:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:48:21,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:21,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:21,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:48:21,592 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1872628209, now seen corresponding path program 1 times [2022-02-20 18:48:21,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:21,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700309715] [2022-02-20 18:48:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:21,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {8765#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(66, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33017~0 := 0;~__return_33136~0 := 0;~__tmp_33297_0~0 := 0;~__return_33329~0 := 0;~__return_33342~0 := 0; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {8767#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:21,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {8767#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {8768#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:48:21,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {8768#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {8768#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:48:21,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {8768#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33017~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33017~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8769#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:48:21,702 INFO L290 TraceCheckUtils]: 41: Hoare triple {8769#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {8766#false} is VALID [2022-02-20 18:48:21,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {8766#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); {8766#false} is VALID [2022-02-20 18:48:21,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {8766#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {8766#false} assume !!(0 == ~mode3~0 % 256); {8766#false} is VALID [2022-02-20 18:48:21,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {8766#false} assume !!(0 == ~alive3~0 % 256); {8766#false} is VALID [2022-02-20 18:48:21,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {8766#false} assume !(~send3~0 != ~id3~0); {8766#false} is VALID [2022-02-20 18:48:21,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {8766#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {8766#false} assume !!(0 == ~mode4~0 % 256); {8766#false} is VALID [2022-02-20 18:48:21,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {8766#false} assume !!(0 == ~alive4~0 % 256); {8766#false} is VALID [2022-02-20 18:48:21,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {8766#false} assume !(~send4~0 != ~id4~0); {8766#false} is VALID [2022-02-20 18:48:21,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {8766#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {8766#false} assume !!(0 == ~mode5~0 % 256); {8766#false} is VALID [2022-02-20 18:48:21,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {8766#false} assume !!(0 == ~alive5~0 % 256); {8766#false} is VALID [2022-02-20 18:48:21,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {8766#false} assume !(~send5~0 != ~id5~0); {8766#false} is VALID [2022-02-20 18:48:21,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {8766#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8766#false} is VALID [2022-02-20 18:48:21,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {8766#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {8766#false} is VALID [2022-02-20 18:48:21,709 INFO L290 TraceCheckUtils]: 57: Hoare triple {8766#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_33136~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33136~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; {8766#false} is VALID [2022-02-20 18:48:21,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {8766#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; {8766#false} is VALID [2022-02-20 18:48:21,710 INFO L290 TraceCheckUtils]: 59: Hoare triple {8766#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {8766#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {8766#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8766#false} is VALID [2022-02-20 18:48:21,710 INFO L290 TraceCheckUtils]: 62: Hoare triple {8766#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {8766#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {8766#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {8766#false} is VALID [2022-02-20 18:48:21,711 INFO L290 TraceCheckUtils]: 65: Hoare triple {8766#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,711 INFO L290 TraceCheckUtils]: 66: Hoare triple {8766#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {8766#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {8766#false} is VALID [2022-02-20 18:48:21,711 INFO L290 TraceCheckUtils]: 68: Hoare triple {8766#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,711 INFO L290 TraceCheckUtils]: 69: Hoare triple {8766#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,711 INFO L290 TraceCheckUtils]: 70: Hoare triple {8766#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {8766#false} is VALID [2022-02-20 18:48:21,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {8766#false} ~mode4~0 := 0;~__tmp_33297_0~0 := main_~main____CPAchecker_TMP_0~0#1; {8766#false} is VALID [2022-02-20 18:48:21,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {8766#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_33297_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,712 INFO L290 TraceCheckUtils]: 73: Hoare triple {8766#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8766#false} is VALID [2022-02-20 18:48:21,712 INFO L290 TraceCheckUtils]: 74: Hoare triple {8766#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {8766#false} is VALID [2022-02-20 18:48:21,712 INFO L290 TraceCheckUtils]: 75: Hoare triple {8766#false} ~mode5~0 := 0; {8766#false} is VALID [2022-02-20 18:48:21,712 INFO L290 TraceCheckUtils]: 76: Hoare triple {8766#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {8766#false} is VALID [2022-02-20 18:48:21,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {8766#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {8766#false} is VALID [2022-02-20 18:48:21,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {8766#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {8766#false} is VALID [2022-02-20 18:48:21,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {8766#false} ~__return_33329~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33329~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {8766#false} is VALID [2022-02-20 18:48:21,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {8766#false} assume 0 == main_~assert__arg~1#1 % 256; {8766#false} is VALID [2022-02-20 18:48:21,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {8766#false} assume !false; {8766#false} is VALID [2022-02-20 18:48:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:21,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:21,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700309715] [2022-02-20 18:48:21,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700309715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:21,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:21,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:21,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016503248] [2022-02-20 18:48:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:21,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:48:21,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:21,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:21,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:21,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:21,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:21,768 INFO L87 Difference]: Start difference. First operand 1125 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:24,342 INFO L93 Difference]: Finished difference Result 3049 states and 4737 transitions. [2022-02-20 18:48:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:48:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2022-02-20 18:48:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2022-02-20 18:48:24,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 701 transitions. [2022-02-20 18:48:24,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:24,954 INFO L225 Difference]: With dead ends: 3049 [2022-02-20 18:48:24,954 INFO L226 Difference]: Without dead ends: 1979 [2022-02-20 18:48:24,957 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:48:24,964 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 1140 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:24,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1140 Valid, 281 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2022-02-20 18:48:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1977. [2022-02-20 18:48:26,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:26,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1979 states. Second operand has 1977 states, 1976 states have (on average 1.5455465587044535) internal successors, (3054), 1976 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:26,937 INFO L74 IsIncluded]: Start isIncluded. First operand 1979 states. Second operand has 1977 states, 1976 states have (on average 1.5455465587044535) internal successors, (3054), 1976 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:26,940 INFO L87 Difference]: Start difference. First operand 1979 states. Second operand has 1977 states, 1976 states have (on average 1.5455465587044535) internal successors, (3054), 1976 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:27,041 INFO L93 Difference]: Finished difference Result 1979 states and 3055 transitions. [2022-02-20 18:48:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3055 transitions. [2022-02-20 18:48:27,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:27,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:27,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 1977 states, 1976 states have (on average 1.5455465587044535) internal successors, (3054), 1976 states have internal predecessors, (3054), 0 states have call successors, (0), 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 1979 states. [2022-02-20 18:48:27,048 INFO L87 Difference]: Start difference. First operand has 1977 states, 1976 states have (on average 1.5455465587044535) internal successors, (3054), 1976 states have internal predecessors, (3054), 0 states have call successors, (0), 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 1979 states. [2022-02-20 18:48:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:27,150 INFO L93 Difference]: Finished difference Result 1979 states and 3055 transitions. [2022-02-20 18:48:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3055 transitions. [2022-02-20 18:48:27,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:27,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:27,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:27,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.5455465587044535) internal successors, (3054), 1976 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 3054 transitions. [2022-02-20 18:48:27,292 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 3054 transitions. Word has length 82 [2022-02-20 18:48:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:27,293 INFO L470 AbstractCegarLoop]: Abstraction has 1977 states and 3054 transitions. [2022-02-20 18:48:27,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 3054 transitions. [2022-02-20 18:48:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:48:27,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:27,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:27,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:48:27,295 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1410777150, now seen corresponding path program 1 times [2022-02-20 18:48:27,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:27,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079882079] [2022-02-20 18:48:27,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:27,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:27,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {19506#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(66, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33017~0 := 0;~__return_33136~0 := 0;~__tmp_33297_0~0 := 0;~__return_33329~0 := 0;~__return_33342~0 := 0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {19508#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:27,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {19508#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {19509#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:48:27,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {19509#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {19509#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:48:27,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {19509#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 >= 0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st5~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send5~0 == ~id5~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode5~0 % 256; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id5~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id5~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id5~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33017~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33017~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19510#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:48:27,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {19510#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {19507#false} is VALID [2022-02-20 18:48:27,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {19507#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); {19507#false} is VALID [2022-02-20 18:48:27,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {19507#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {19507#false} assume !!(0 == ~mode4~0 % 256); {19507#false} is VALID [2022-02-20 18:48:27,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {19507#false} assume !!(0 == ~alive4~0 % 256); {19507#false} is VALID [2022-02-20 18:48:27,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {19507#false} assume !(~send4~0 != ~id4~0); {19507#false} is VALID [2022-02-20 18:48:27,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {19507#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,389 INFO L290 TraceCheckUtils]: 52: Hoare triple {19507#false} assume !!(0 == ~mode5~0 % 256); {19507#false} is VALID [2022-02-20 18:48:27,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {19507#false} assume !!(0 == ~alive5~0 % 256); {19507#false} is VALID [2022-02-20 18:48:27,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {19507#false} assume !(~send5~0 != ~id5~0); {19507#false} is VALID [2022-02-20 18:48:27,389 INFO L290 TraceCheckUtils]: 55: Hoare triple {19507#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19507#false} is VALID [2022-02-20 18:48:27,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {19507#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {19507#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_33136~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33136~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; {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {19507#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; {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {19507#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {19507#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 61: Hoare triple {19507#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 62: Hoare triple {19507#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 63: Hoare triple {19507#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,390 INFO L290 TraceCheckUtils]: 64: Hoare triple {19507#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {19507#false} is VALID [2022-02-20 18:48:27,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {19507#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {19507#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {19507#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {19507#false} is VALID [2022-02-20 18:48:27,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {19507#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {19507#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {19507#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {19507#false} is VALID [2022-02-20 18:48:27,391 INFO L290 TraceCheckUtils]: 71: Hoare triple {19507#false} ~mode4~0 := 0;~__tmp_33297_0~0 := main_~main____CPAchecker_TMP_0~0#1; {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {19507#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_33297_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {19507#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {19507#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {19507#false} ~mode5~0 := 0; {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {19507#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {19507#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 78: Hoare triple {19507#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {19507#false} is VALID [2022-02-20 18:48:27,392 INFO L290 TraceCheckUtils]: 79: Hoare triple {19507#false} ~__return_33329~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33329~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {19507#false} is VALID [2022-02-20 18:48:27,393 INFO L290 TraceCheckUtils]: 80: Hoare triple {19507#false} assume 0 == main_~assert__arg~1#1 % 256; {19507#false} is VALID [2022-02-20 18:48:27,393 INFO L290 TraceCheckUtils]: 81: Hoare triple {19507#false} assume !false; {19507#false} is VALID [2022-02-20 18:48:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:27,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:27,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079882079] [2022-02-20 18:48:27,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079882079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:27,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:27,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:27,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895979341] [2022-02-20 18:48:27,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:27,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:48:27,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:27,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:27,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:27,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:27,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:27,445 INFO L87 Difference]: Start difference. First operand 1977 states and 3054 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:33,558 INFO L93 Difference]: Finished difference Result 5484 states and 8533 transitions. [2022-02-20 18:48:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:48:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2022-02-20 18:48:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2022-02-20 18:48:33,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 675 transitions. [2022-02-20 18:48:33,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 675 edges. 675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:34,413 INFO L225 Difference]: With dead ends: 5484 [2022-02-20 18:48:34,413 INFO L226 Difference]: Without dead ends: 3585 [2022-02-20 18:48:34,415 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:48:34,420 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 1098 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:34,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1098 Valid, 285 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2022-02-20 18:48:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3583. [2022-02-20 18:48:37,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:37,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3585 states. Second operand has 3583 states, 3582 states have (on average 1.5466219988833054) internal successors, (5540), 3582 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:37,536 INFO L74 IsIncluded]: Start isIncluded. First operand 3585 states. Second operand has 3583 states, 3582 states have (on average 1.5466219988833054) internal successors, (5540), 3582 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:37,557 INFO L87 Difference]: Start difference. First operand 3585 states. Second operand has 3583 states, 3582 states have (on average 1.5466219988833054) internal successors, (5540), 3582 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:37,927 INFO L93 Difference]: Finished difference Result 3585 states and 5541 transitions. [2022-02-20 18:48:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 5541 transitions. [2022-02-20 18:48:37,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:37,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:37,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 3583 states, 3582 states have (on average 1.5466219988833054) internal successors, (5540), 3582 states have internal predecessors, (5540), 0 states have call successors, (0), 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 3585 states. [2022-02-20 18:48:37,948 INFO L87 Difference]: Start difference. First operand has 3583 states, 3582 states have (on average 1.5466219988833054) internal successors, (5540), 3582 states have internal predecessors, (5540), 0 states have call successors, (0), 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 3585 states. [2022-02-20 18:48:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:38,386 INFO L93 Difference]: Finished difference Result 3585 states and 5541 transitions. [2022-02-20 18:48:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 5541 transitions. [2022-02-20 18:48:38,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:48:38,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:48:38,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:48:38,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:48:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 1.5466219988833054) internal successors, (5540), 3582 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 5540 transitions. [2022-02-20 18:48:38,888 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 5540 transitions. Word has length 82 [2022-02-20 18:48:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:48:38,888 INFO L470 AbstractCegarLoop]: Abstraction has 3583 states and 5540 transitions. [2022-02-20 18:48:38,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 5540 transitions. [2022-02-20 18:48:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:48:38,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:48:38,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:48:38,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:48:38,891 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:48:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:48:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1933266084, now seen corresponding path program 1 times [2022-02-20 18:48:38,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:48:38,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950526078] [2022-02-20 18:48:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:48:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:48:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:48:38,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {39044#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(66, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33017~0 := 0;~__return_33136~0 := 0;~__tmp_33297_0~0 := 0;~__return_33329~0 := 0;~__return_33342~0 := 0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {39046#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:48:38,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {39046#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {39047#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:48:38,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {39047#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {39047#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:48:38,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {39047#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33017~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33017~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive1~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive2~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~id2~0); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive3~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~id3~0); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,968 INFO L290 TraceCheckUtils]: 46: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive4~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~id4~0); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256); {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(0 == ~alive5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {39048#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:48:38,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {39048#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {39045#false} is VALID [2022-02-20 18:48:38,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {39045#false} ~p5_new~0 := (if main_~node5____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node5____CPAchecker_TMP_0~0#1 % 256 else main_~node5____CPAchecker_TMP_0~0#1 % 256 - 256); {39045#false} is VALID [2022-02-20 18:48:38,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {39045#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {39045#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {39045#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_33136~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33136~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; {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {39045#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; {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {39045#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {39045#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {39045#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 62: Hoare triple {39045#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {39045#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {39045#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {39045#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 66: Hoare triple {39045#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 67: Hoare triple {39045#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {39045#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {39045#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {39045#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {39045#false} is VALID [2022-02-20 18:48:38,975 INFO L290 TraceCheckUtils]: 71: Hoare triple {39045#false} ~mode4~0 := 0;~__tmp_33297_0~0 := main_~main____CPAchecker_TMP_0~0#1; {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 72: Hoare triple {39045#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_33297_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {39045#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {39045#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 75: Hoare triple {39045#false} ~mode5~0 := 0; {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 76: Hoare triple {39045#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 77: Hoare triple {39045#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 78: Hoare triple {39045#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {39045#false} is VALID [2022-02-20 18:48:38,976 INFO L290 TraceCheckUtils]: 79: Hoare triple {39045#false} ~__return_33329~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33329~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {39045#false} is VALID [2022-02-20 18:48:38,977 INFO L290 TraceCheckUtils]: 80: Hoare triple {39045#false} assume 0 == main_~assert__arg~1#1 % 256; {39045#false} is VALID [2022-02-20 18:48:38,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {39045#false} assume !false; {39045#false} is VALID [2022-02-20 18:48:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:48:38,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:48:38,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950526078] [2022-02-20 18:48:38,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950526078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:48:38,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:48:38,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:48:38,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684971651] [2022-02-20 18:48:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:48:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:48:38,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:48:38,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:39,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:39,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:48:39,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:48:39,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:48:39,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:48:39,026 INFO L87 Difference]: Start difference. First operand 3583 states and 5540 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:48:50,053 INFO L93 Difference]: Finished difference Result 10066 states and 15649 transitions. [2022-02-20 18:48:50,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:48:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:48:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:48:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-02-20 18:48:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-02-20 18:48:50,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 634 transitions. [2022-02-20 18:48:50,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:48:52,176 INFO L225 Difference]: With dead ends: 10066 [2022-02-20 18:48:52,176 INFO L226 Difference]: Without dead ends: 6625 [2022-02-20 18:48:52,180 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:48:52,180 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 1054 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:48:52,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1054 Valid, 296 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:48:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2022-02-20 18:48:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6623. [2022-02-20 18:48:59,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:48:59,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6625 states. Second operand has 6623 states, 6622 states have (on average 1.5468136514648143) internal successors, (10243), 6622 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:59,121 INFO L74 IsIncluded]: Start isIncluded. First operand 6625 states. Second operand has 6623 states, 6622 states have (on average 1.5468136514648143) internal successors, (10243), 6622 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:48:59,130 INFO L87 Difference]: Start difference. First operand 6625 states. Second operand has 6623 states, 6622 states have (on average 1.5468136514648143) internal successors, (10243), 6622 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:00,326 INFO L93 Difference]: Finished difference Result 6625 states and 10244 transitions. [2022-02-20 18:49:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10244 transitions. [2022-02-20 18:49:00,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:00,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:00,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 6623 states, 6622 states have (on average 1.5468136514648143) internal successors, (10243), 6622 states have internal predecessors, (10243), 0 states have call successors, (0), 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 6625 states. [2022-02-20 18:49:00,344 INFO L87 Difference]: Start difference. First operand has 6623 states, 6622 states have (on average 1.5468136514648143) internal successors, (10243), 6622 states have internal predecessors, (10243), 0 states have call successors, (0), 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 6625 states. [2022-02-20 18:49:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:01,547 INFO L93 Difference]: Finished difference Result 6625 states and 10244 transitions. [2022-02-20 18:49:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10244 transitions. [2022-02-20 18:49:01,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:01,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:01,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:01,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 6622 states have (on average 1.5468136514648143) internal successors, (10243), 6622 states have internal predecessors, (10243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 10243 transitions. [2022-02-20 18:49:03,265 INFO L78 Accepts]: Start accepts. Automaton has 6623 states and 10243 transitions. Word has length 82 [2022-02-20 18:49:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:03,265 INFO L470 AbstractCegarLoop]: Abstraction has 6623 states and 10243 transitions. [2022-02-20 18:49:03,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 6623 states and 10243 transitions. [2022-02-20 18:49:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:49:03,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:03,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:49:03,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:49:03,267 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:03,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1259416403, now seen corresponding path program 1 times [2022-02-20 18:49:03,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:03,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413299836] [2022-02-20 18:49:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:03,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {75234#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(66, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~__return_33017~0 := 0;~__return_33136~0 := 0;~__tmp_33297_0~0 := 0;~__return_33329~0 := 0;~__return_33342~0 := 0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5____CPAchecker_TMP_1~0#1, main_~node5__m5~1#1, main_~node4__m4~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5____CPAchecker_TMP_1~1#1, main_~node5__m5~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4__m4~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {75236#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:03,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {75236#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {75237#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:49:03,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {75237#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {75237#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:49:03,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {75237#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_33017~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_33017~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive1~0 % 256); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,358 INFO L290 TraceCheckUtils]: 39: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive2~0 % 256); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~id2~0); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,359 INFO L290 TraceCheckUtils]: 43: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive3~0 % 256); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~id3~0); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256); {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == ~alive4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {75238#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:03,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {75238#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {75235#false} is VALID [2022-02-20 18:49:03,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {75235#false} ~p4_new~0 := (if main_~node4____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node4____CPAchecker_TMP_0~0#1 % 256 else main_~node4____CPAchecker_TMP_0~0#1 % 256 - 256); {75235#false} is VALID [2022-02-20 18:49:03,361 INFO L290 TraceCheckUtils]: 51: Hoare triple {75235#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,361 INFO L290 TraceCheckUtils]: 52: Hoare triple {75235#false} assume !!(0 == ~mode5~0 % 256); {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {75235#false} assume !!(0 == ~alive5~0 % 256); {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {75235#false} assume !(~send5~0 != ~id5~0); {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {75235#false} ~mode5~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {75235#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {75235#false} assume ~r1~0 < 5;main_~check__tmp~0#1 := 1;~__return_33136~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_33136~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; {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {75235#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; {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 59: Hoare triple {75235#false} assume main_~main__i2~0#1 < 10;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 60: Hoare triple {75235#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {75235#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {75235#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {75235#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {75235#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {75235#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {75235#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 67: Hoare triple {75235#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 68: Hoare triple {75235#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,363 INFO L290 TraceCheckUtils]: 69: Hoare triple {75235#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 70: Hoare triple {75235#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 71: Hoare triple {75235#false} ~mode4~0 := 0;~__tmp_33297_0~0 := main_~main____CPAchecker_TMP_0~0#1; {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 72: Hoare triple {75235#false} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_33297_0~0;havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 73: Hoare triple {75235#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 74: Hoare triple {75235#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 75: Hoare triple {75235#false} ~mode5~0 := 0; {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {75235#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 77: Hoare triple {75235#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {75235#false} is VALID [2022-02-20 18:49:03,364 INFO L290 TraceCheckUtils]: 78: Hoare triple {75235#false} assume ~r1~0 < 5;main_~check__tmp~1#1 := 1; {75235#false} is VALID [2022-02-20 18:49:03,365 INFO L290 TraceCheckUtils]: 79: Hoare triple {75235#false} ~__return_33329~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_33329~0;havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {75235#false} is VALID [2022-02-20 18:49:03,365 INFO L290 TraceCheckUtils]: 80: Hoare triple {75235#false} assume 0 == main_~assert__arg~1#1 % 256; {75235#false} is VALID [2022-02-20 18:49:03,365 INFO L290 TraceCheckUtils]: 81: Hoare triple {75235#false} assume !false; {75235#false} is VALID [2022-02-20 18:49:03,365 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:49:03,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:03,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413299836] [2022-02-20 18:49:03,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413299836] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:03,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:03,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:03,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721201470] [2022-02-20 18:49:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:03,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-02-20 18:49:03,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:03,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:03,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:03,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:03,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:03,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:03,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:03,418 INFO L87 Difference]: Start difference. First operand 6623 states and 10243 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)