./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.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.ufo.UNBOUNDED.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 37da121d1485cf4d7db5098d27ad9010a5336c778943ff6fd7c53fe4a9fdfbdc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:49:03,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:49:03,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:49:03,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:49:03,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:49:03,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:49:03,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:49:03,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:49:03,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:49:03,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:49:03,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:49:03,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:49:03,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:49:03,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:49:03,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:49:03,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:49:03,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:49:03,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:49:03,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:49:03,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:49:03,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:49:03,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:49:03,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:49:03,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:49:03,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:49:03,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:49:03,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:49:03,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:49:03,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:49:03,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:49:03,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:49:03,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:49:03,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:49:03,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:49:03,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:49:03,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:49:03,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:49:03,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:49:03,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:49:03,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:49:03,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:49:03,279 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:49:03,291 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:49:03,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:49:03,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:49:03,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:49:03,292 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:49:03,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:49:03,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:49:03,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:49:03,293 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:49:03,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:49:03,294 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:49:03,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:49:03,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:49:03,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:49:03,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:49:03,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:49:03,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:49:03,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:49:03,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:49:03,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:49:03,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:49:03,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:49:03,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:49:03,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:49:03,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:03,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:49:03,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:49:03,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:49:03,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:49:03,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:49:03,297 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:49:03,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:49:03,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:49:03,298 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 -> 37da121d1485cf4d7db5098d27ad9010a5336c778943ff6fd7c53fe4a9fdfbdc [2022-02-20 18:49:03,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:49:03,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:49:03,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:49:03,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:49:03,495 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:49:03,495 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:03,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac759bd5/8a882487cdff42a282f82885147f921b/FLAG7651658eb [2022-02-20 18:49:03,881 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:49:03,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:03,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac759bd5/8a882487cdff42a282f82885147f921b/FLAG7651658eb [2022-02-20 18:49:04,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac759bd5/8a882487cdff42a282f82885147f921b [2022-02-20 18:49:04,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:49:04,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:49:04,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:04,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:49:04,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:49:04,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abcfed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04, skipping insertion in model container [2022-02-20 18:49:04,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:49:04,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:49:04,566 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.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8458,8471] [2022-02-20 18:49:04,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:04,648 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:49:04,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[8458,8471] [2022-02-20 18:49:04,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:04,768 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:49:04,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04 WrapperNode [2022-02-20 18:49:04,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:04,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:04,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:49:04,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:49:04,775 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:49:04" (1/1) ... [2022-02-20 18:49:04,797 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:49:04" (1/1) ... [2022-02-20 18:49:04,839 INFO L137 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 790 [2022-02-20 18:49:04,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:04,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:49:04,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:49:04,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:49:04,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:49:04,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:49:04,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:49:04,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:49:04,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (1/1) ... [2022-02-20 18:49:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:04,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:49:04,938 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:49:04,942 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:49:04,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:49:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:49:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:49:04,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:49:05,159 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:49:05,160 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:49:05,750 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:49:05,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:49:05,756 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:49:05,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:05 BoogieIcfgContainer [2022-02-20 18:49:05,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:49:05,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:49:05,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:49:05,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:49:05,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:49:04" (1/3) ... [2022-02-20 18:49:05,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f393662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:05, skipping insertion in model container [2022-02-20 18:49:05,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:04" (2/3) ... [2022-02-20 18:49:05,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f393662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:05, skipping insertion in model container [2022-02-20 18:49:05,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:05" (3/3) ... [2022-02-20 18:49:05,763 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:49:05,766 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:49:05,766 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:49:05,808 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:49:05,814 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:49:05,814 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:49:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 213 states have (on average 1.7183098591549295) internal successors, (366), 214 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call 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:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-20 18:49:05,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:05,837 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:49:05,837 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1949123702, now seen corresponding path program 1 times [2022-02-20 18:49:05,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:05,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848840618] [2022-02-20 18:49:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:06,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#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(63, 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_58418~0 := 0;~__return_58538~0 := 0;~__return_58726~0 := 0; {218#true} is VALID [2022-02-20 18:49:06,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#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____CPAchecker_TMP_1~0#1, main_~node1__m1~2#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_~__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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {218#true} is VALID [2022-02-20 18:49:06,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume 0 == ~r1~0 % 256; {218#true} is VALID [2022-02-20 18:49:06,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {218#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {218#true} is VALID [2022-02-20 18:49:06,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {218#true} assume ~id1~0 >= 0; {218#true} is VALID [2022-02-20 18:49:06,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} assume 0 == ~st1~0; {220#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:06,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {220#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:06,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {220#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:06,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(<= ~st1~0 0)} assume ~id2~0 >= 0; {220#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:06,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(<= ~st1~0 0)} assume 0 == ~st2~0; {221#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {221#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {221#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {221#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {221#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {221#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {221#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {222#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {223#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {224#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode4~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive4~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,190 INFO L290 TraceCheckUtils]: 50: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode5~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive5~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_58538~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58538~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,204 INFO L290 TraceCheckUtils]: 67: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,205 INFO L290 TraceCheckUtils]: 68: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,206 INFO L290 TraceCheckUtils]: 69: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node4__m4~1#1 != ~nomsg~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,206 INFO L290 TraceCheckUtils]: 70: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,206 INFO L290 TraceCheckUtils]: 71: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,207 INFO L290 TraceCheckUtils]: 72: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node5__m5~1#1 != ~nomsg~0); {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 0; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,209 INFO L290 TraceCheckUtils]: 75: Hoare triple {224#(<= (+ ~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; {224#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:06,209 INFO L290 TraceCheckUtils]: 76: Hoare triple {224#(<= (+ ~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; {219#false} is VALID [2022-02-20 18:49:06,209 INFO L290 TraceCheckUtils]: 77: Hoare triple {219#false} ~__return_58726~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_58726~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; {219#false} is VALID [2022-02-20 18:49:06,210 INFO L290 TraceCheckUtils]: 78: Hoare triple {219#false} assume 0 == main_~assert__arg~1#1 % 256; {219#false} is VALID [2022-02-20 18:49:06,210 INFO L290 TraceCheckUtils]: 79: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 18:49:06,211 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:06,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:06,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848840618] [2022-02-20 18:49:06,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848840618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:06,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:06,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:49:06,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376881631] [2022-02-20 18:49:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:06,218 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:49:06,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:06,221 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:49:06,288 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:49:06,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:49:06,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:49:06,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:49:06,304 INFO L87 Difference]: Start difference. First operand has 215 states, 213 states have (on average 1.7183098591549295) internal successors, (366), 214 states have internal predecessors, (366), 0 states have call successors, (0), 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:49:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:08,487 INFO L93 Difference]: Finished difference Result 867 states and 1402 transitions. [2022-02-20 18:49:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:49:08,488 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:49:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:08,489 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:49:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1402 transitions. [2022-02-20 18:49:08,501 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:49:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1402 transitions. [2022-02-20 18:49:08,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1402 transitions. [2022-02-20 18:49:09,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1402 edges. 1402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:09,545 INFO L225 Difference]: With dead ends: 867 [2022-02-20 18:49:09,546 INFO L226 Difference]: Without dead ends: 747 [2022-02-20 18:49:09,548 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:49:09,551 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 2370 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 2217 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:09,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2370 Valid, 2217 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-02-20 18:49:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 328. [2022-02-20 18:49:09,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:09,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 328 states, 327 states have (on average 1.507645259938838) internal successors, (493), 327 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call 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:09,700 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 328 states, 327 states have (on average 1.507645259938838) internal successors, (493), 327 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call 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:09,701 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 328 states, 327 states have (on average 1.507645259938838) internal successors, (493), 327 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call 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:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:09,724 INFO L93 Difference]: Finished difference Result 747 states and 1159 transitions. [2022-02-20 18:49:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1159 transitions. [2022-02-20 18:49:09,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:09,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:09,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 327 states have (on average 1.507645259938838) internal successors, (493), 327 states have internal predecessors, (493), 0 states have call successors, (0), 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 747 states. [2022-02-20 18:49:09,729 INFO L87 Difference]: Start difference. First operand has 328 states, 327 states have (on average 1.507645259938838) internal successors, (493), 327 states have internal predecessors, (493), 0 states have call successors, (0), 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 747 states. [2022-02-20 18:49:09,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:09,752 INFO L93 Difference]: Finished difference Result 747 states and 1159 transitions. [2022-02-20 18:49:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1159 transitions. [2022-02-20 18:49:09,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:09,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:09,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:09,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.507645259938838) internal successors, (493), 327 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call 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:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 493 transitions. [2022-02-20 18:49:09,762 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 493 transitions. Word has length 80 [2022-02-20 18:49:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:09,763 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 493 transitions. [2022-02-20 18:49:09,763 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:49:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 493 transitions. [2022-02-20 18:49:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 18:49:09,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:09,765 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:49:09,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:49:09,765 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash 13403552, now seen corresponding path program 1 times [2022-02-20 18:49:09,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:09,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047342823] [2022-02-20 18:49:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:09,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {3317#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(63, 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_58418~0 := 0;~__return_58538~0 := 0;~__return_58726~0 := 0; {3317#true} is VALID [2022-02-20 18:49:09,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#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____CPAchecker_TMP_1~0#1, main_~node1__m1~2#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_~__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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {3317#true} is VALID [2022-02-20 18:49:09,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume 0 == ~r1~0 % 256; {3317#true} is VALID [2022-02-20 18:49:09,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {3317#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3319#(<= (+ (* (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:49:09,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {3319#(<= (+ (* (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; {3319#(<= (+ (* (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:49:09,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {3319#(<= (+ (* (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_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {3319#(<= (+ (* (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:49:09,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {3319#(<= (+ (* (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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3319#(<= (+ (* (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:49:09,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {3319#(<= (+ (* (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); {3319#(<= (+ (* (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:49:09,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {3319#(<= (+ (* (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); {3320#(<= (+ (* (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:49:09,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {3320#(<= (+ (* (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 !(~send1~0 != ~id1~0); {3320#(<= (+ (* (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:49:09,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {3320#(<= (+ (* (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; {3320#(<= (+ (* (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:49:09,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {3320#(<= (+ (* (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); {3320#(<= (+ (* (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:49:09,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {3320#(<= (+ (* (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); {3321#(<= (+ (* (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:49:09,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {3321#(<= (+ (* (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); {3321#(<= (+ (* (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:49:09,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {3321#(<= (+ (* (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; {3321#(<= (+ (* (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:49:09,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {3321#(<= (+ (* (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); {3321#(<= (+ (* (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:49:09,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {3321#(<= (+ (* (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); {3322#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:09,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {3322#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:09,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {3322#(<= (+ (* 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; {3322#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:09,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {3322#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~mode4~0 % 256); {3322#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:49:09,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {3322#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !!(0 == ~alive4~0 % 256); {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:09,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:09,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:09,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~mode5~0 % 256); {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:49:09,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {3323#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !!(0 == ~alive5~0 % 256); {3318#false} is VALID [2022-02-20 18:49:09,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {3318#false} assume !(~send5~0 != ~id5~0); {3318#false} is VALID [2022-02-20 18:49:09,965 INFO L290 TraceCheckUtils]: 54: Hoare triple {3318#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; {3318#false} is VALID [2022-02-20 18:49:09,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {3318#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3318#false} is VALID [2022-02-20 18:49:09,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {3318#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_58538~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58538~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; {3318#false} is VALID [2022-02-20 18:49:09,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {3318#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {3318#false} assume !(0 == ~mode1~0 % 256); {3318#false} is VALID [2022-02-20 18:49:09,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {3318#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {3318#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3318#false} is VALID [2022-02-20 18:49:09,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {3318#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {3318#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {3318#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3318#false} is VALID [2022-02-20 18:49:09,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {3318#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {3318#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {3318#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {3318#false} is VALID [2022-02-20 18:49:09,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {3318#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {3318#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {3318#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {3318#false} is VALID [2022-02-20 18:49:09,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {3318#false} ~mode4~0 := 0; {3318#false} is VALID [2022-02-20 18:49:09,967 INFO L290 TraceCheckUtils]: 71: Hoare triple {3318#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,967 INFO L290 TraceCheckUtils]: 72: Hoare triple {3318#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3318#false} is VALID [2022-02-20 18:49:09,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {3318#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {3318#false} is VALID [2022-02-20 18:49:09,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {3318#false} ~mode5~0 := 0; {3318#false} is VALID [2022-02-20 18:49:09,968 INFO L290 TraceCheckUtils]: 75: Hoare triple {3318#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; {3318#false} is VALID [2022-02-20 18:49:09,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {3318#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3318#false} is VALID [2022-02-20 18:49:09,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {3318#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {3318#false} is VALID [2022-02-20 18:49:09,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {3318#false} ~__return_58726~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_58726~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; {3318#false} is VALID [2022-02-20 18:49:09,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {3318#false} assume 0 == main_~assert__arg~1#1 % 256; {3318#false} is VALID [2022-02-20 18:49:09,969 INFO L290 TraceCheckUtils]: 80: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-02-20 18:49:09,970 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:09,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:09,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047342823] [2022-02-20 18:49:09,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047342823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:09,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:09,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:49:09,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283674058] [2022-02-20 18:49:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:09,972 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:49:09,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:09,972 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:49:10,035 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:49:10,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:49:10,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:10,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:49:10,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:49:10,037 INFO L87 Difference]: Start difference. First operand 328 states and 493 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:49:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:12,529 INFO L93 Difference]: Finished difference Result 1424 states and 2210 transitions. [2022-02-20 18:49:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:49:12,529 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:49:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:12,530 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:49:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1258 transitions. [2022-02-20 18:49:12,536 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:49:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1258 transitions. [2022-02-20 18:49:12,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1258 transitions. [2022-02-20 18:49:13,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1258 edges. 1258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:13,594 INFO L225 Difference]: With dead ends: 1424 [2022-02-20 18:49:13,594 INFO L226 Difference]: Without dead ends: 1176 [2022-02-20 18:49:13,596 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:49:13,600 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 1464 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:13,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1464 Valid, 1464 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2022-02-20 18:49:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1168. [2022-02-20 18:49:14,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:14,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1176 states. Second operand has 1168 states, 1167 states have (on average 1.5475578406169666) internal successors, (1806), 1167 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call 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:14,342 INFO L74 IsIncluded]: Start isIncluded. First operand 1176 states. Second operand has 1168 states, 1167 states have (on average 1.5475578406169666) internal successors, (1806), 1167 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call 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:14,344 INFO L87 Difference]: Start difference. First operand 1176 states. Second operand has 1168 states, 1167 states have (on average 1.5475578406169666) internal successors, (1806), 1167 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call 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:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:14,390 INFO L93 Difference]: Finished difference Result 1176 states and 1810 transitions. [2022-02-20 18:49:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1810 transitions. [2022-02-20 18:49:14,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:14,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:14,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 1168 states, 1167 states have (on average 1.5475578406169666) internal successors, (1806), 1167 states have internal predecessors, (1806), 0 states have call successors, (0), 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 1176 states. [2022-02-20 18:49:14,396 INFO L87 Difference]: Start difference. First operand has 1168 states, 1167 states have (on average 1.5475578406169666) internal successors, (1806), 1167 states have internal predecessors, (1806), 0 states have call successors, (0), 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 1176 states. [2022-02-20 18:49:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:14,440 INFO L93 Difference]: Finished difference Result 1176 states and 1810 transitions. [2022-02-20 18:49:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1810 transitions. [2022-02-20 18:49:14,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:14,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:14,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:14,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 1.5475578406169666) internal successors, (1806), 1167 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call 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:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1806 transitions. [2022-02-20 18:49:14,498 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1806 transitions. Word has length 81 [2022-02-20 18:49:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:14,500 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 1806 transitions. [2022-02-20 18:49:14,500 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:49:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1806 transitions. [2022-02-20 18:49:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:49:14,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:14,501 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:14,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:49:14,502 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2050473049, now seen corresponding path program 1 times [2022-02-20 18:49:14,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:14,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031203884] [2022-02-20 18:49:14,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:14,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {9130#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(63, 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_58418~0 := 0;~__return_58538~0 := 0;~__return_58726~0 := 0; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {9132#(<= (+ ~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____CPAchecker_TMP_1~0#1, main_~node1__m1~2#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_~__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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {9132#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:14,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {9132#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {9133#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:49:14,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {9133#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {9133#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:49:14,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {9133#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 >= 0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st4~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send4~0 == ~id4~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode4~0 % 256; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id5~0 >= 0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~st5~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send5~0 == ~id5~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode5~0 % 256; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id4~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id5~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id4~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id5~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id4~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id3~0 != ~id5~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {9134#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send1~0 != ~id1~0); {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive2~0 % 256); {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send2~0 != ~id2~0); {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9134#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:49:14,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {9134#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {9131#false} is VALID [2022-02-20 18:49:14,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {9131#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); {9131#false} is VALID [2022-02-20 18:49:14,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {9131#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {9131#false} assume !!(0 == ~mode4~0 % 256); {9131#false} is VALID [2022-02-20 18:49:14,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {9131#false} assume !!(0 == ~alive4~0 % 256); {9131#false} is VALID [2022-02-20 18:49:14,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {9131#false} assume !(~send4~0 != ~id4~0); {9131#false} is VALID [2022-02-20 18:49:14,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {9131#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {9131#false} assume !!(0 == ~mode5~0 % 256); {9131#false} is VALID [2022-02-20 18:49:14,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {9131#false} assume !!(0 == ~alive5~0 % 256); {9131#false} is VALID [2022-02-20 18:49:14,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {9131#false} assume !(~send5~0 != ~id5~0); {9131#false} is VALID [2022-02-20 18:49:14,671 INFO L290 TraceCheckUtils]: 55: Hoare triple {9131#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; {9131#false} is VALID [2022-02-20 18:49:14,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {9131#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {9131#false} is VALID [2022-02-20 18:49:14,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {9131#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_58538~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58538~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; {9131#false} is VALID [2022-02-20 18:49:14,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {9131#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {9131#false} assume !(0 == ~mode1~0 % 256); {9131#false} is VALID [2022-02-20 18:49:14,672 INFO L290 TraceCheckUtils]: 60: Hoare triple {9131#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,672 INFO L290 TraceCheckUtils]: 61: Hoare triple {9131#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {9131#false} is VALID [2022-02-20 18:49:14,672 INFO L290 TraceCheckUtils]: 62: Hoare triple {9131#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,672 INFO L290 TraceCheckUtils]: 63: Hoare triple {9131#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,672 INFO L290 TraceCheckUtils]: 64: Hoare triple {9131#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {9131#false} is VALID [2022-02-20 18:49:14,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {9131#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {9131#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,673 INFO L290 TraceCheckUtils]: 67: Hoare triple {9131#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {9131#false} is VALID [2022-02-20 18:49:14,673 INFO L290 TraceCheckUtils]: 68: Hoare triple {9131#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {9131#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {9131#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {9131#false} is VALID [2022-02-20 18:49:14,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {9131#false} ~mode4~0 := 0; {9131#false} is VALID [2022-02-20 18:49:14,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {9131#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {9131#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {9131#false} is VALID [2022-02-20 18:49:14,674 INFO L290 TraceCheckUtils]: 74: Hoare triple {9131#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {9131#false} is VALID [2022-02-20 18:49:14,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {9131#false} ~mode5~0 := 0; {9131#false} is VALID [2022-02-20 18:49:14,674 INFO L290 TraceCheckUtils]: 76: Hoare triple {9131#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; {9131#false} is VALID [2022-02-20 18:49:14,674 INFO L290 TraceCheckUtils]: 77: Hoare triple {9131#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {9131#false} is VALID [2022-02-20 18:49:14,674 INFO L290 TraceCheckUtils]: 78: Hoare triple {9131#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {9131#false} is VALID [2022-02-20 18:49:14,674 INFO L290 TraceCheckUtils]: 79: Hoare triple {9131#false} ~__return_58726~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_58726~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; {9131#false} is VALID [2022-02-20 18:49:14,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {9131#false} assume 0 == main_~assert__arg~1#1 % 256; {9131#false} is VALID [2022-02-20 18:49:14,675 INFO L290 TraceCheckUtils]: 81: Hoare triple {9131#false} assume !false; {9131#false} is VALID [2022-02-20 18:49:14,675 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:14,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:14,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031203884] [2022-02-20 18:49:14,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031203884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:14,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:14,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:14,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728795728] [2022-02-20 18:49:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:14,678 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:14,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:14,679 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:14,745 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:14,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:14,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:14,747 INFO L87 Difference]: Start difference. First operand 1168 states and 1806 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:49:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:17,806 INFO L93 Difference]: Finished difference Result 3105 states and 4859 transitions. [2022-02-20 18:49:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:17,806 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:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:17,806 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:49:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2022-02-20 18:49:17,818 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:49:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2022-02-20 18:49:17,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 709 transitions. [2022-02-20 18:49:18,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:18,434 INFO L225 Difference]: With dead ends: 3105 [2022-02-20 18:49:18,435 INFO L226 Difference]: Without dead ends: 2018 [2022-02-20 18:49:18,437 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:49:18,437 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 1164 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:18,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 298 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-02-20 18:49:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2016. [2022-02-20 18:49:20,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:20,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2018 states. Second operand has 2016 states, 2015 states have (on average 1.5563275434243176) internal successors, (3136), 2015 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call 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:20,209 INFO L74 IsIncluded]: Start isIncluded. First operand 2018 states. Second operand has 2016 states, 2015 states have (on average 1.5563275434243176) internal successors, (3136), 2015 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call 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:20,211 INFO L87 Difference]: Start difference. First operand 2018 states. Second operand has 2016 states, 2015 states have (on average 1.5563275434243176) internal successors, (3136), 2015 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call 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:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:20,327 INFO L93 Difference]: Finished difference Result 2018 states and 3137 transitions. [2022-02-20 18:49:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3137 transitions. [2022-02-20 18:49:20,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:20,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:20,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 2016 states, 2015 states have (on average 1.5563275434243176) internal successors, (3136), 2015 states have internal predecessors, (3136), 0 states have call successors, (0), 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 2018 states. [2022-02-20 18:49:20,337 INFO L87 Difference]: Start difference. First operand has 2016 states, 2015 states have (on average 1.5563275434243176) internal successors, (3136), 2015 states have internal predecessors, (3136), 0 states have call successors, (0), 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 2018 states. [2022-02-20 18:49:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:20,454 INFO L93 Difference]: Finished difference Result 2018 states and 3137 transitions. [2022-02-20 18:49:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3137 transitions. [2022-02-20 18:49:20,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:20,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:20,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:20,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2015 states have (on average 1.5563275434243176) internal successors, (3136), 2015 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call 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:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3136 transitions. [2022-02-20 18:49:20,619 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3136 transitions. Word has length 82 [2022-02-20 18:49:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:20,619 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 3136 transitions. [2022-02-20 18:49:20,620 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:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3136 transitions. [2022-02-20 18:49:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:49:20,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:20,621 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:20,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:49:20,621 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash 269412074, now seen corresponding path program 1 times [2022-02-20 18:49:20,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:20,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336779693] [2022-02-20 18:49:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:20,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {20104#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(63, 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_58418~0 := 0;~__return_58538~0 := 0;~__return_58726~0 := 0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {20106#(<= (+ ~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____CPAchecker_TMP_1~0#1, main_~node1__m1~2#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_~__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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {20106#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:20,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {20106#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {20107#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:49:20,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {20107#(<= (+ ~nomsg~0 1) ~id4~0)} assume 0 == ~st4~0; {20107#(<= (+ ~nomsg~0 1) ~id4~0)} is VALID [2022-02-20 18:49:20,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {20107#(<= (+ ~nomsg~0 1) ~id4~0)} assume ~send4~0 == ~id4~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode4~0 % 256; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id5~0 >= 0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~st5~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~send5~0 == ~id5~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume 0 == ~mode5~0 % 256; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id2~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id3~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id4~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id1~0 != ~id5~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id3~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id4~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id2~0 != ~id5~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id4~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id3~0 != ~id5~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {20108#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode1~0 % 256); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive1~0 % 256); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send1~0 != ~id1~0); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode2~0 % 256); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive2~0 % 256); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send2~0 != ~id2~0); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode3~0 % 256); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~alive3~0 % 256); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send3~0 != ~id3~0); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !!(0 == ~mode4~0 % 256); {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(0 == ~alive4~0 % 256);havoc main_~node4____CPAchecker_TMP_0~0#1; {20108#(<= (+ ~nomsg~0 1) ~send4~0)} is VALID [2022-02-20 18:49:20,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {20108#(<= (+ ~nomsg~0 1) ~send4~0)} assume !(~send4~0 != ~nomsg~0);main_~node4____CPAchecker_TMP_0~0#1 := ~p4_new~0; {20105#false} is VALID [2022-02-20 18:49:20,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {20105#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); {20105#false} is VALID [2022-02-20 18:49:20,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {20105#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {20105#false} assume !!(0 == ~mode5~0 % 256); {20105#false} is VALID [2022-02-20 18:49:20,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {20105#false} assume !!(0 == ~alive5~0 % 256); {20105#false} is VALID [2022-02-20 18:49:20,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {20105#false} assume !(~send5~0 != ~id5~0); {20105#false} is VALID [2022-02-20 18:49:20,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {20105#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; {20105#false} is VALID [2022-02-20 18:49:20,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {20105#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {20105#false} is VALID [2022-02-20 18:49:20,709 INFO L290 TraceCheckUtils]: 57: Hoare triple {20105#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_58538~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58538~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; {20105#false} is VALID [2022-02-20 18:49:20,709 INFO L290 TraceCheckUtils]: 58: Hoare triple {20105#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {20105#false} assume !(0 == ~mode1~0 % 256); {20105#false} is VALID [2022-02-20 18:49:20,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {20105#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {20105#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {20105#false} is VALID [2022-02-20 18:49:20,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {20105#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {20105#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {20105#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {20105#false} is VALID [2022-02-20 18:49:20,711 INFO L290 TraceCheckUtils]: 65: Hoare triple {20105#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,711 INFO L290 TraceCheckUtils]: 66: Hoare triple {20105#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,711 INFO L290 TraceCheckUtils]: 67: Hoare triple {20105#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {20105#false} is VALID [2022-02-20 18:49:20,711 INFO L290 TraceCheckUtils]: 68: Hoare triple {20105#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,711 INFO L290 TraceCheckUtils]: 69: Hoare triple {20105#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,711 INFO L290 TraceCheckUtils]: 70: Hoare triple {20105#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {20105#false} is VALID [2022-02-20 18:49:20,711 INFO L290 TraceCheckUtils]: 71: Hoare triple {20105#false} ~mode4~0 := 0; {20105#false} is VALID [2022-02-20 18:49:20,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {20105#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,712 INFO L290 TraceCheckUtils]: 73: Hoare triple {20105#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {20105#false} is VALID [2022-02-20 18:49:20,712 INFO L290 TraceCheckUtils]: 74: Hoare triple {20105#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {20105#false} is VALID [2022-02-20 18:49:20,712 INFO L290 TraceCheckUtils]: 75: Hoare triple {20105#false} ~mode5~0 := 0; {20105#false} is VALID [2022-02-20 18:49:20,712 INFO L290 TraceCheckUtils]: 76: Hoare triple {20105#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; {20105#false} is VALID [2022-02-20 18:49:20,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {20105#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {20105#false} is VALID [2022-02-20 18:49:20,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {20105#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {20105#false} is VALID [2022-02-20 18:49:20,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {20105#false} ~__return_58726~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_58726~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; {20105#false} is VALID [2022-02-20 18:49:20,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {20105#false} assume 0 == main_~assert__arg~1#1 % 256; {20105#false} is VALID [2022-02-20 18:49:20,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {20105#false} assume !false; {20105#false} is VALID [2022-02-20 18:49:20,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:49:20,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:20,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336779693] [2022-02-20 18:49:20,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336779693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:20,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:20,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:20,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841158578] [2022-02-20 18:49:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:20,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:49:20,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:20,717 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:20,778 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:20,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:20,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:20,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:20,780 INFO L87 Difference]: Start difference. First operand 2016 states and 3136 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:49:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:26,802 INFO L93 Difference]: Finished difference Result 5537 states and 8684 transitions. [2022-02-20 18:49:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:26,802 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:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:26,803 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:49:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2022-02-20 18:49:26,821 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:49:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2022-02-20 18:49:26,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 683 transitions. [2022-02-20 18:49:27,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:27,605 INFO L225 Difference]: With dead ends: 5537 [2022-02-20 18:49:27,605 INFO L226 Difference]: Without dead ends: 3632 [2022-02-20 18:49:27,608 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:49:27,608 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 1130 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 298 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:49:27,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1130 Valid, 298 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2022-02-20 18:49:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3630. [2022-02-20 18:49:31,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:31,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3632 states. Second operand has 3630 states, 3629 states have (on average 1.5593827500688895) internal successors, (5659), 3629 states have internal predecessors, (5659), 0 states have call successors, (0), 0 states have call 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:31,558 INFO L74 IsIncluded]: Start isIncluded. First operand 3632 states. Second operand has 3630 states, 3629 states have (on average 1.5593827500688895) internal successors, (5659), 3629 states have internal predecessors, (5659), 0 states have call successors, (0), 0 states have call 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:31,561 INFO L87 Difference]: Start difference. First operand 3632 states. Second operand has 3630 states, 3629 states have (on average 1.5593827500688895) internal successors, (5659), 3629 states have internal predecessors, (5659), 0 states have call successors, (0), 0 states have call 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:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:32,023 INFO L93 Difference]: Finished difference Result 3632 states and 5660 transitions. [2022-02-20 18:49:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5660 transitions. [2022-02-20 18:49:32,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:32,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:32,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 3630 states, 3629 states have (on average 1.5593827500688895) internal successors, (5659), 3629 states have internal predecessors, (5659), 0 states have call successors, (0), 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 3632 states. [2022-02-20 18:49:32,036 INFO L87 Difference]: Start difference. First operand has 3630 states, 3629 states have (on average 1.5593827500688895) internal successors, (5659), 3629 states have internal predecessors, (5659), 0 states have call successors, (0), 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 3632 states. [2022-02-20 18:49:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:32,441 INFO L93 Difference]: Finished difference Result 3632 states and 5660 transitions. [2022-02-20 18:49:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5660 transitions. [2022-02-20 18:49:32,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:32,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:32,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:32,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3629 states have (on average 1.5593827500688895) internal successors, (5659), 3629 states have internal predecessors, (5659), 0 states have call successors, (0), 0 states have call 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:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 5659 transitions. [2022-02-20 18:49:33,020 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 5659 transitions. Word has length 82 [2022-02-20 18:49:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:33,020 INFO L470 AbstractCegarLoop]: Abstraction has 3630 states and 5659 transitions. [2022-02-20 18:49:33,020 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:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 5659 transitions. [2022-02-20 18:49:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:49:33,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:33,022 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:33,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:49:33,022 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:33,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash 778028859, now seen corresponding path program 1 times [2022-02-20 18:49:33,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:33,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558250299] [2022-02-20 18:49:33,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:33,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:33,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {39938#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(63, 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_58418~0 := 0;~__return_58538~0 := 0;~__return_58726~0 := 0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {39940#(<= (+ ~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____CPAchecker_TMP_1~0#1, main_~node1__m1~2#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_~__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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st3~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~send3~0 == ~id3~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode3~0 % 256; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~id4~0 >= 0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st4~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~send4~0 == ~id4~0; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode4~0 % 256; {39940#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:33,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {39940#(<= (+ ~nomsg~0 1) 0)} assume ~id5~0 >= 0; {39941#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:49:33,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {39941#(<= (+ ~nomsg~0 1) ~id5~0)} assume 0 == ~st5~0; {39941#(<= (+ ~nomsg~0 1) ~id5~0)} is VALID [2022-02-20 18:49:33,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {39941#(<= (+ ~nomsg~0 1) ~id5~0)} assume ~send5~0 == ~id5~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume 0 == ~mode5~0 % 256; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id2~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id3~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id4~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id1~0 != ~id5~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id3~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id4~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id2~0 != ~id5~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id4~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id3~0 != ~id5~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {39942#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode1~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive1~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send1~0 != ~id1~0); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode2~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive2~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send2~0 != ~id2~0); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode3~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive3~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send3~0 != ~id3~0); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode4~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~alive4~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send4~0 != ~id4~0); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !!(0 == ~mode5~0 % 256); {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(0 == ~alive5~0 % 256);havoc main_~node5____CPAchecker_TMP_0~0#1; {39942#(<= (+ ~nomsg~0 1) ~send5~0)} is VALID [2022-02-20 18:49:33,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {39942#(<= (+ ~nomsg~0 1) ~send5~0)} assume !(~send5~0 != ~nomsg~0);main_~node5____CPAchecker_TMP_0~0#1 := ~p5_new~0; {39939#false} is VALID [2022-02-20 18:49:33,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {39939#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); {39939#false} is VALID [2022-02-20 18:49:33,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {39939#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; {39939#false} is VALID [2022-02-20 18:49:33,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {39939#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {39939#false} is VALID [2022-02-20 18:49:33,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {39939#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_58538~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58538~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; {39939#false} is VALID [2022-02-20 18:49:33,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {39939#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {39939#false} assume !(0 == ~mode1~0 % 256); {39939#false} is VALID [2022-02-20 18:49:33,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {39939#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {39939#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {39939#false} is VALID [2022-02-20 18:49:33,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {39939#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {39939#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {39939#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {39939#false} is VALID [2022-02-20 18:49:33,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {39939#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {39939#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 67: Hoare triple {39939#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 68: Hoare triple {39939#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {39939#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {39939#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {39939#false} ~mode4~0 := 0; {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {39939#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {39939#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {39939#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {39939#false} is VALID [2022-02-20 18:49:33,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {39939#false} ~mode5~0 := 0; {39939#false} is VALID [2022-02-20 18:49:33,115 INFO L290 TraceCheckUtils]: 76: Hoare triple {39939#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; {39939#false} is VALID [2022-02-20 18:49:33,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {39939#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {39939#false} is VALID [2022-02-20 18:49:33,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {39939#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {39939#false} is VALID [2022-02-20 18:49:33,115 INFO L290 TraceCheckUtils]: 79: Hoare triple {39939#false} ~__return_58726~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_58726~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; {39939#false} is VALID [2022-02-20 18:49:33,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {39939#false} assume 0 == main_~assert__arg~1#1 % 256; {39939#false} is VALID [2022-02-20 18:49:33,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {39939#false} assume !false; {39939#false} is VALID [2022-02-20 18:49:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:33,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:33,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558250299] [2022-02-20 18:49:33,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558250299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:33,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:33,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:33,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433480601] [2022-02-20 18:49:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:33,119 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:33,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:33,120 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:33,158 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:33,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:33,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:33,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:33,159 INFO L87 Difference]: Start difference. First operand 3630 states and 5659 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:49:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:45,608 INFO L93 Difference]: Finished difference Result 10317 states and 16188 transitions. [2022-02-20 18:49:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:45,609 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:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:45,609 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:49:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2022-02-20 18:49:45,611 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:49:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2022-02-20 18:49:45,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 666 transitions. [2022-02-20 18:49:45,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 666 edges. 666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:47,747 INFO L225 Difference]: With dead ends: 10317 [2022-02-20 18:49:47,747 INFO L226 Difference]: Without dead ends: 6832 [2022-02-20 18:49:47,771 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:49:47,772 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 1114 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:47,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 309 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:49:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2022-02-20 18:49:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6830. [2022-02-20 18:49:55,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:55,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6832 states. Second operand has 6830 states, 6829 states have (on average 1.5618685019768634) internal successors, (10666), 6829 states have internal predecessors, (10666), 0 states have call successors, (0), 0 states have call 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:55,862 INFO L74 IsIncluded]: Start isIncluded. First operand 6832 states. Second operand has 6830 states, 6829 states have (on average 1.5618685019768634) internal successors, (10666), 6829 states have internal predecessors, (10666), 0 states have call successors, (0), 0 states have call 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:55,867 INFO L87 Difference]: Start difference. First operand 6832 states. Second operand has 6830 states, 6829 states have (on average 1.5618685019768634) internal successors, (10666), 6829 states have internal predecessors, (10666), 0 states have call successors, (0), 0 states have call 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:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:57,319 INFO L93 Difference]: Finished difference Result 6832 states and 10667 transitions. [2022-02-20 18:49:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10667 transitions. [2022-02-20 18:49:57,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:57,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:57,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 6830 states, 6829 states have (on average 1.5618685019768634) internal successors, (10666), 6829 states have internal predecessors, (10666), 0 states have call successors, (0), 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 6832 states. [2022-02-20 18:49:57,338 INFO L87 Difference]: Start difference. First operand has 6830 states, 6829 states have (on average 1.5618685019768634) internal successors, (10666), 6829 states have internal predecessors, (10666), 0 states have call successors, (0), 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 6832 states. [2022-02-20 18:49:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:58,807 INFO L93 Difference]: Finished difference Result 6832 states and 10667 transitions. [2022-02-20 18:49:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 10667 transitions. [2022-02-20 18:49:58,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:58,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:58,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:58,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6830 states, 6829 states have (on average 1.5618685019768634) internal successors, (10666), 6829 states have internal predecessors, (10666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 10666 transitions. [2022-02-20 18:50:00,778 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 10666 transitions. Word has length 82 [2022-02-20 18:50:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:00,778 INFO L470 AbstractCegarLoop]: Abstraction has 6830 states and 10666 transitions. [2022-02-20 18:50:00,778 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:50:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 10666 transitions. [2022-02-20 18:50:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 18:50:00,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:00,780 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:50:00,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:00,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1091254392, now seen corresponding path program 1 times [2022-02-20 18:50:00,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:00,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696061960] [2022-02-20 18:50:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:00,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {77256#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(63, 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_58418~0 := 0;~__return_58538~0 := 0;~__return_58726~0 := 0; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {77258#(<= (+ ~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____CPAchecker_TMP_1~0#1, main_~node1__m1~2#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_~__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____CPAchecker_TMP_1~1#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_~init__tmp~0#1; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {77258#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {77258#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {77258#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {77258#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {77258#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {77258#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {77258#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:00,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {77258#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {77259#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:00,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {77259#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {77259#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:00,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {77259#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 >= 0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st4~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send4~0 == ~id4~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode4~0 % 256; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id5~0 >= 0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st5~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send5~0 == ~id5~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode5~0 % 256; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id4~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id5~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id4~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id5~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id4~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 != ~id5~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id4~0 != ~id5~0;main_~init__tmp~0#1 := 1;~__return_58418~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_58418~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {77260#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send1~0 != ~id1~0); {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {77260#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:00,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {77260#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {77257#false} is VALID [2022-02-20 18:50:00,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {77257#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); {77257#false} is VALID [2022-02-20 18:50:00,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {77257#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {77257#false} assume !!(0 == ~mode3~0 % 256); {77257#false} is VALID [2022-02-20 18:50:00,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {77257#false} assume !!(0 == ~alive3~0 % 256); {77257#false} is VALID [2022-02-20 18:50:00,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {77257#false} assume !(~send3~0 != ~id3~0); {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {77257#false} ~mode3~0 := 1;havoc main_~node4__m4~0#1;main_~node4__m4~0#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {77257#false} assume !!(0 == ~mode4~0 % 256); {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {77257#false} assume !!(0 == ~alive4~0 % 256); {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {77257#false} assume !(~send4~0 != ~id4~0); {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {77257#false} ~mode4~0 := 1;havoc main_~node5__m5~0#1;main_~node5__m5~0#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {77257#false} assume !!(0 == ~mode5~0 % 256); {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {77257#false} assume !!(0 == ~alive5~0 % 256); {77257#false} is VALID [2022-02-20 18:50:00,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {77257#false} assume !(~send5~0 != ~id5~0); {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {77257#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; {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {77257#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {77257#false} assume ~r1~0 % 256 < 5;main_~check__tmp~0#1 := 1;~__return_58538~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_58538~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; {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {77257#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {77257#false} assume !(0 == ~mode1~0 % 256); {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {77257#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {77257#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {77257#false} is VALID [2022-02-20 18:50:00,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {77257#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {77257#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {77257#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {77257#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {77257#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {77257#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {77257#false} ~mode3~0 := 0;havoc main_~node4__m4~1#1;main_~node4__m4~1#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {77257#false} assume !(0 == ~mode4~0 % 256);main_~node4__m4~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {77257#false} assume !(main_~node4__m4~1#1 != ~nomsg~0); {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {77257#false} ~mode4~0 := 0; {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {77257#false} havoc main_~node5__m5~1#1;main_~node5__m5~1#1 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {77257#false} assume !(0 == ~mode5~0 % 256);main_~node5__m5~1#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {77257#false} assume !(main_~node5__m5~1#1 != ~nomsg~0); {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 75: Hoare triple {77257#false} ~mode5~0 := 0; {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 76: Hoare triple {77257#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; {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {77257#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 78: Hoare triple {77257#false} assume ~r1~0 % 256 < 5;main_~check__tmp~1#1 := 1; {77257#false} is VALID [2022-02-20 18:50:00,861 INFO L290 TraceCheckUtils]: 79: Hoare triple {77257#false} ~__return_58726~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_58726~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; {77257#false} is VALID [2022-02-20 18:50:00,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {77257#false} assume 0 == main_~assert__arg~1#1 % 256; {77257#false} is VALID [2022-02-20 18:50:00,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {77257#false} assume !false; {77257#false} is VALID [2022-02-20 18:50:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:00,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:00,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696061960] [2022-02-20 18:50:00,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696061960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:00,862 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:00,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:00,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103985529] [2022-02-20 18:50:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:00,863 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:50:00,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:00,864 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:50:00,915 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:50:00,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:00,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:00,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:00,916 INFO L87 Difference]: Start difference. First operand 6830 states and 10666 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)