./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65b8d16e4fb153ef37dd57c64863e1dd20ac9a55503c1fdc63aa83fadd0f6c16 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:17,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:17,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:17,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:17,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:17,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:17,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:17,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:17,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:17,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:17,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:17,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:17,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:17,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:17,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:17,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:17,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:17,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:17,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:17,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:17,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:17,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:17,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:17,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:17,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:17,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:17,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:17,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:17,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:17,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:17,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:17,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:17,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:17,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:17,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:17,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:17,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:17,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:17,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:17,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:17,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:17,190 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:50:17,213 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:17,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:17,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:17,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:17,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:17,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:17,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:17,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:17,214 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:17,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:17,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:17,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:17,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:17,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:17,217 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 -> 65b8d16e4fb153ef37dd57c64863e1dd20ac9a55503c1fdc63aa83fadd0f6c16 [2022-02-20 18:50:17,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:17,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:17,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:17,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:17,434 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:17,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:50:17,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19cf8929/516624d6cd7a4d58838743f1667b1d82/FLAGd7886539c [2022-02-20 18:50:17,810 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:17,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:50:17,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19cf8929/516624d6cd7a4d58838743f1667b1d82/FLAGd7886539c [2022-02-20 18:50:18,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19cf8929/516624d6cd7a4d58838743f1667b1d82 [2022-02-20 18:50:18,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:18,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:18,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:18,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:18,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:18,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e25075c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18, skipping insertion in model container [2022-02-20 18:50:18,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:18,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:18,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7182,7195] [2022-02-20 18:50:18,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9513,9526] [2022-02-20 18:50:18,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:18,518 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:18,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7182,7195] [2022-02-20 18:50:18,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9513,9526] [2022-02-20 18:50:18,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:18,599 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:18,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18 WrapperNode [2022-02-20 18:50:18,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:18,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:18,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:18,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:18,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,663 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 466 [2022-02-20 18:50:18,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:18,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:18,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:18,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:18,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:18,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:18,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:18,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:18,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (1/1) ... [2022-02-20 18:50:18,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:18,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:18,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:50:18,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:50:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:18,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:18,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:18,882 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:18,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:19,311 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:19,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:19,318 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:19,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:19 BoogieIcfgContainer [2022-02-20 18:50:19,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:19,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:19,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:19,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:19,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:18" (1/3) ... [2022-02-20 18:50:19,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ae7995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:19, skipping insertion in model container [2022-02-20 18:50:19,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:18" (2/3) ... [2022-02-20 18:50:19,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ae7995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:19, skipping insertion in model container [2022-02-20 18:50:19,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:19" (3/3) ... [2022-02-20 18:50:19,327 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:50:19,330 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:19,330 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 18:50:19,368 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:19,373 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:50:19,373 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 18:50:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:19,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:19,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:19,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1038847250, now seen corresponding path program 1 times [2022-02-20 18:50:19,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:19,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134120407] [2022-02-20 18:50:19,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:19,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {109#true} is VALID [2022-02-20 18:50:19,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {109#true} is VALID [2022-02-20 18:50:19,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume 0 == ~r1~0; {109#true} is VALID [2022-02-20 18:50:19,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} assume ~id1~0 >= 0; {109#true} is VALID [2022-02-20 18:50:19,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {109#true} assume 0 == ~st1~0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:19,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:19,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:19,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#(<= ~st1~0 0)} assume ~id2~0 >= 0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:19,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#(<= ~st1~0 0)} assume 0 == ~st2~0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:19,764 INFO L290 TraceCheckUtils]: 44: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1719~0;~__tmp_1622_0~0 := main_~main____CPAchecker_TMP_0~0#1; {110#false} is VALID [2022-02-20 18:50:19,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {110#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1622_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {110#false} is VALID [2022-02-20 18:50:19,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {110#false} assume 0 == main_~assert__arg~2#1 % 256; {110#false} is VALID [2022-02-20 18:50:19,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:50:19,767 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:19,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:19,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134120407] [2022-02-20 18:50:19,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134120407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:19,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:19,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:19,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678449395] [2022-02-20 18:50:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:19,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:19,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:19,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:19,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:19,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:19,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:19,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:19,833 INFO L87 Difference]: Start difference. First operand has 106 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 105 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:20,669 INFO L93 Difference]: Finished difference Result 416 states and 663 transitions. [2022-02-20 18:50:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:50:20,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2022-02-20 18:50:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2022-02-20 18:50:20,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 663 transitions. [2022-02-20 18:50:21,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 663 edges. 663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:21,140 INFO L225 Difference]: With dead ends: 416 [2022-02-20 18:50:21,141 INFO L226 Difference]: Without dead ends: 353 [2022-02-20 18:50:21,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:21,154 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 596 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:21,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 768 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-02-20 18:50:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 155. [2022-02-20 18:50:21,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:21,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,233 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,233 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,244 INFO L93 Difference]: Finished difference Result 353 states and 509 transitions. [2022-02-20 18:50:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 509 transitions. [2022-02-20 18:50:21,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:21,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:21,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 353 states. [2022-02-20 18:50:21,247 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 353 states. [2022-02-20 18:50:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,257 INFO L93 Difference]: Finished difference Result 353 states and 509 transitions. [2022-02-20 18:50:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 509 transitions. [2022-02-20 18:50:21,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:21,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:21,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:21,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 154 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2022-02-20 18:50:21,263 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 48 [2022-02-20 18:50:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:21,264 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2022-02-20 18:50:21,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2022-02-20 18:50:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:21,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:21,265 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:21,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:21,265 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1964840261, now seen corresponding path program 1 times [2022-02-20 18:50:21,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:21,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057236913] [2022-02-20 18:50:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:21,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {1572#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {1572#true} is VALID [2022-02-20 18:50:21,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1572#true} is VALID [2022-02-20 18:50:21,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} assume 0 == ~r1~0; {1572#true} is VALID [2022-02-20 18:50:21,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {1572#true} assume ~id1~0 >= 0; {1572#true} is VALID [2022-02-20 18:50:21,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {1572#true} assume 0 == ~st1~0; {1572#true} is VALID [2022-02-20 18:50:21,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#true} assume ~send1~0 == ~id1~0; {1572#true} is VALID [2022-02-20 18:50:21,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {1572#true} assume 0 == ~mode1~0 % 256; {1572#true} is VALID [2022-02-20 18:50:21,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#true} assume ~id2~0 >= 0; {1572#true} is VALID [2022-02-20 18:50:21,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#true} assume 0 == ~st2~0; {1572#true} is VALID [2022-02-20 18:50:21,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#true} assume ~send2~0 == ~id2~0; {1572#true} is VALID [2022-02-20 18:50:21,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {1572#true} assume 0 == ~mode2~0 % 256; {1572#true} is VALID [2022-02-20 18:50:21,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#true} assume ~id3~0 >= 0; {1572#true} is VALID [2022-02-20 18:50:21,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {1572#true} assume 0 == ~st3~0; {1572#true} is VALID [2022-02-20 18:50:21,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#true} assume ~send3~0 == ~id3~0; {1572#true} is VALID [2022-02-20 18:50:21,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#true} assume 0 == ~mode3~0 % 256; {1572#true} is VALID [2022-02-20 18:50:21,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1572#true} assume ~id1~0 != ~id2~0; {1572#true} is VALID [2022-02-20 18:50:21,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#true} assume ~id1~0 != ~id3~0; {1572#true} is VALID [2022-02-20 18:50:21,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {1572#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {1572#true} is VALID [2022-02-20 18:50:21,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#true} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1572#true} is VALID [2022-02-20 18:50:21,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {1572#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1572#true} is VALID [2022-02-20 18:50:21,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1572#true} is VALID [2022-02-20 18:50:21,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {1572#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1572#true} is VALID [2022-02-20 18:50:21,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {1572#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1572#true} is VALID [2022-02-20 18:50:21,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {1572#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1572#true} is VALID [2022-02-20 18:50:21,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {1572#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1572#true} is VALID [2022-02-20 18:50:21,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {1572#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1572#true} is VALID [2022-02-20 18:50:21,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {1572#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1572#true} is VALID [2022-02-20 18:50:21,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {1572#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {1572#true} is VALID [2022-02-20 18:50:21,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {1572#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1572#true} is VALID [2022-02-20 18:50:21,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {1572#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1572#true} is VALID [2022-02-20 18:50:21,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#true} assume !(~r1~0 >= 3); {1572#true} is VALID [2022-02-20 18:50:21,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {1572#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {1573#false} is VALID [2022-02-20 18:50:21,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {1573#false} assume 0 == main_~assert__arg~3#1 % 256; {1573#false} is VALID [2022-02-20 18:50:21,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {1573#false} assume !false; {1573#false} is VALID [2022-02-20 18:50:21,352 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:21,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:21,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057236913] [2022-02-20 18:50:21,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057236913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:21,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:21,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:21,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140700236] [2022-02-20 18:50:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:21,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:50:21,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:21,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:21,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:21,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:21,382 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,565 INFO L93 Difference]: Finished difference Result 244 states and 352 transitions. [2022-02-20 18:50:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:21,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 18:50:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2022-02-20 18:50:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2022-02-20 18:50:21,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 290 transitions. [2022-02-20 18:50:21,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:21,759 INFO L225 Difference]: With dead ends: 244 [2022-02-20 18:50:21,759 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 18:50:21,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:21,760 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:21,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 301 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 18:50:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-02-20 18:50:21,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:21,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,796 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,796 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,799 INFO L93 Difference]: Finished difference Result 159 states and 221 transitions. [2022-02-20 18:50:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2022-02-20 18:50:21,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:21,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:21,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 159 states. [2022-02-20 18:50:21,800 INFO L87 Difference]: Start difference. First operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 159 states. [2022-02-20 18:50:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:21,803 INFO L93 Difference]: Finished difference Result 159 states and 221 transitions. [2022-02-20 18:50:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2022-02-20 18:50:21,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:21,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:21,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:21,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 156 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 220 transitions. [2022-02-20 18:50:21,813 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 220 transitions. Word has length 49 [2022-02-20 18:50:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:21,813 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 220 transitions. [2022-02-20 18:50:21,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 220 transitions. [2022-02-20 18:50:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:21,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:21,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:21,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:21,815 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:21,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1398279763, now seen corresponding path program 1 times [2022-02-20 18:50:21,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:21,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196288197] [2022-02-20 18:50:21,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:21,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:21,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {2410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {2410#true} is VALID [2022-02-20 18:50:21,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2410#true} is VALID [2022-02-20 18:50:21,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {2410#true} assume 0 == ~r1~0; {2410#true} is VALID [2022-02-20 18:50:21,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {2410#true} assume ~id1~0 >= 0; {2410#true} is VALID [2022-02-20 18:50:21,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {2410#true} assume 0 == ~st1~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {2412#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {2412#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~st2~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {2412#(<= ~st1~0 0)} assume ~id3~0 >= 0; {2412#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:21,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {2412#(<= ~st1~0 0)} assume 0 == ~st3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {2413#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:21,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {2413#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:21,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:21,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:21,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:21,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:21,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {2414#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1719~0;~__tmp_1622_0~0 := main_~main____CPAchecker_TMP_0~0#1; {2411#false} is VALID [2022-02-20 18:50:21,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {2411#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1622_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {2411#false} is VALID [2022-02-20 18:50:21,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {2411#false} assume 0 == main_~assert__arg~2#1 % 256; {2411#false} is VALID [2022-02-20 18:50:21,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-02-20 18:50:21,900 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:21,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:21,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196288197] [2022-02-20 18:50:21,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196288197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:21,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:21,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:21,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063863655] [2022-02-20 18:50:21,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:21,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:21,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:21,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:21,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:21,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:21,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:21,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:21,931 INFO L87 Difference]: Start difference. First operand 157 states and 220 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:22,428 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2022-02-20 18:50:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:22,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-02-20 18:50:22,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:22,710 INFO L225 Difference]: With dead ends: 470 [2022-02-20 18:50:22,710 INFO L226 Difference]: Without dead ends: 388 [2022-02-20 18:50:22,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:22,712 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 299 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:22,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 532 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-02-20 18:50:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 248. [2022-02-20 18:50:22,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:22,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,808 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,808 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:22,817 INFO L93 Difference]: Finished difference Result 388 states and 562 transitions. [2022-02-20 18:50:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 562 transitions. [2022-02-20 18:50:22,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:22,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:22,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 388 states. [2022-02-20 18:50:22,819 INFO L87 Difference]: Start difference. First operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 388 states. [2022-02-20 18:50:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:22,827 INFO L93 Difference]: Finished difference Result 388 states and 562 transitions. [2022-02-20 18:50:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 562 transitions. [2022-02-20 18:50:22,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:22,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:22,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:22,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 247 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 359 transitions. [2022-02-20 18:50:22,833 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 359 transitions. Word has length 50 [2022-02-20 18:50:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:22,833 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 359 transitions. [2022-02-20 18:50:22,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 359 transitions. [2022-02-20 18:50:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:22,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:22,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:22,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:22,835 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1526101883, now seen corresponding path program 1 times [2022-02-20 18:50:22,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:22,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840441816] [2022-02-20 18:50:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:22,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {4147#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {4147#true} is VALID [2022-02-20 18:50:22,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {4147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {4147#true} is VALID [2022-02-20 18:50:22,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {4147#true} assume 0 == ~r1~0; {4147#true} is VALID [2022-02-20 18:50:22,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {4147#true} assume ~id1~0 >= 0; {4147#true} is VALID [2022-02-20 18:50:22,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {4147#true} assume 0 == ~st1~0; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:22,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {4149#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:22,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {4149#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:22,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {4149#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4149#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:22,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {4149#(<= ~st1~0 0)} assume 0 == ~st2~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,908 INFO L290 TraceCheckUtils]: 35: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {4150#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:22,911 INFO L290 TraceCheckUtils]: 44: Hoare triple {4150#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:22,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:22,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {4151#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1719~0;~__tmp_1622_0~0 := main_~main____CPAchecker_TMP_0~0#1; {4148#false} is VALID [2022-02-20 18:50:22,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1622_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {4148#false} is VALID [2022-02-20 18:50:22,912 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#false} assume 0 == main_~assert__arg~2#1 % 256; {4148#false} is VALID [2022-02-20 18:50:22,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#false} assume !false; {4148#false} is VALID [2022-02-20 18:50:22,912 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:22,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:22,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840441816] [2022-02-20 18:50:22,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840441816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:22,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:22,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:22,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956665501] [2022-02-20 18:50:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:22,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:22,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:22,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:22,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:22,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:22,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:22,942 INFO L87 Difference]: Start difference. First operand 248 states and 359 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:23,474 INFO L93 Difference]: Finished difference Result 556 states and 821 transitions. [2022-02-20 18:50:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:23,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:23,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-02-20 18:50:23,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:23,744 INFO L225 Difference]: With dead ends: 556 [2022-02-20 18:50:23,744 INFO L226 Difference]: Without dead ends: 474 [2022-02-20 18:50:23,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:23,745 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 357 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:23,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 537 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-02-20 18:50:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 376. [2022-02-20 18:50:23,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:23,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,884 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,885 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:23,894 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2022-02-20 18:50:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 693 transitions. [2022-02-20 18:50:23,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:23,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:23,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 474 states. [2022-02-20 18:50:23,896 INFO L87 Difference]: Start difference. First operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 474 states. [2022-02-20 18:50:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:23,905 INFO L93 Difference]: Finished difference Result 474 states and 693 transitions. [2022-02-20 18:50:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 693 transitions. [2022-02-20 18:50:23,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:23,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:23,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:23,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 1.4786096256684491) internal successors, (553), 375 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 553 transitions. [2022-02-20 18:50:23,914 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 553 transitions. Word has length 50 [2022-02-20 18:50:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:23,914 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 553 transitions. [2022-02-20 18:50:23,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 553 transitions. [2022-02-20 18:50:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:23,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:23,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:23,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:23,915 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2031133031, now seen corresponding path program 1 times [2022-02-20 18:50:23,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:23,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905374885] [2022-02-20 18:50:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:23,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {6352#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {6352#true} is VALID [2022-02-20 18:50:23,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {6352#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {6352#true} is VALID [2022-02-20 18:50:23,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {6352#true} assume 0 == ~r1~0; {6352#true} is VALID [2022-02-20 18:50:23,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {6352#true} assume ~id1~0 >= 0; {6352#true} is VALID [2022-02-20 18:50:23,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {6352#true} assume 0 == ~st1~0; {6352#true} is VALID [2022-02-20 18:50:23,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {6352#true} assume ~send1~0 == ~id1~0; {6352#true} is VALID [2022-02-20 18:50:23,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {6352#true} assume 0 == ~mode1~0 % 256; {6352#true} is VALID [2022-02-20 18:50:23,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {6352#true} assume ~id2~0 >= 0; {6352#true} is VALID [2022-02-20 18:50:23,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {6352#true} assume 0 == ~st2~0; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:23,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {6354#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:23,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {6354#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:23,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {6354#(<= ~st2~0 0)} assume ~id3~0 >= 0; {6354#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:23,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {6354#(<= ~st2~0 0)} assume 0 == ~st3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 3); {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {6355#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:23,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {6355#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:23,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {6356#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1719~0;~__tmp_1622_0~0 := main_~main____CPAchecker_TMP_0~0#1; {6353#false} is VALID [2022-02-20 18:50:23,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {6353#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1622_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {6353#false} is VALID [2022-02-20 18:50:23,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {6353#false} assume 0 == main_~assert__arg~2#1 % 256; {6353#false} is VALID [2022-02-20 18:50:23,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {6353#false} assume !false; {6353#false} is VALID [2022-02-20 18:50:23,987 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:23,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:23,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905374885] [2022-02-20 18:50:23,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905374885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:23,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:23,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:23,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854683105] [2022-02-20 18:50:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:23,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:23,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:23,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:24,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:24,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:24,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:24,016 INFO L87 Difference]: Start difference. First operand 376 states and 553 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:24,653 INFO L93 Difference]: Finished difference Result 647 states and 960 transitions. [2022-02-20 18:50:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:24,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-02-20 18:50:24,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-02-20 18:50:24,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:24,911 INFO L225 Difference]: With dead ends: 647 [2022-02-20 18:50:24,911 INFO L226 Difference]: Without dead ends: 565 [2022-02-20 18:50:24,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:24,913 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 362 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:24,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 550 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-02-20 18:50:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 467. [2022-02-20 18:50:25,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:25,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 565 states. Second operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:25,183 INFO L74 IsIncluded]: Start isIncluded. First operand 565 states. Second operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:25,183 INFO L87 Difference]: Start difference. First operand 565 states. Second operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:25,202 INFO L93 Difference]: Finished difference Result 565 states and 832 transitions. [2022-02-20 18:50:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 832 transitions. [2022-02-20 18:50:25,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:25,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:25,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 565 states. [2022-02-20 18:50:25,205 INFO L87 Difference]: Start difference. First operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 565 states. [2022-02-20 18:50:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:25,216 INFO L93 Difference]: Finished difference Result 565 states and 832 transitions. [2022-02-20 18:50:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 832 transitions. [2022-02-20 18:50:25,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:25,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:25,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:25,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 465 states have (on average 1.4881720430107528) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 692 transitions. [2022-02-20 18:50:25,231 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 692 transitions. Word has length 50 [2022-02-20 18:50:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:25,231 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 692 transitions. [2022-02-20 18:50:25,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 692 transitions. [2022-02-20 18:50:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:25,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:25,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:25,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:25,233 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 222346276, now seen corresponding path program 1 times [2022-02-20 18:50:25,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:25,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841124510] [2022-02-20 18:50:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:25,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {8989#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {8991#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {8991#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {8991#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:25,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {8991#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {8992#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:25,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {8992#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {8992#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:25,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {8992#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {8993#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:25,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {8993#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {8990#false} is VALID [2022-02-20 18:50:25,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {8990#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {8990#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {8990#false} is VALID [2022-02-20 18:50:25,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {8990#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {8990#false} is VALID [2022-02-20 18:50:25,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {8990#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {8990#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {8990#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {8990#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {8990#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {8990#false} assume !(~r1~0 >= 3); {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {8990#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {8990#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {8990#false} is VALID [2022-02-20 18:50:25,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {8990#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {8990#false} is VALID [2022-02-20 18:50:25,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {8990#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {8990#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {8990#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {8990#false} is VALID [2022-02-20 18:50:25,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {8990#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {8990#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {8990#false} assume main_~node2__m2~1#1 != ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {8990#false} assume !(main_~node2__m2~1#1 > ~id2~0); {8990#false} is VALID [2022-02-20 18:50:25,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {8990#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {8990#false} is VALID [2022-02-20 18:50:25,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {8990#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {8990#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8990#false} is VALID [2022-02-20 18:50:25,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {8990#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {8990#false} is VALID [2022-02-20 18:50:25,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {8990#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {8990#false} is VALID [2022-02-20 18:50:25,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {8990#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {8990#false} is VALID [2022-02-20 18:50:25,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {8990#false} assume !(~r1~0 >= 3); {8990#false} is VALID [2022-02-20 18:50:25,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {8990#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {8990#false} is VALID [2022-02-20 18:50:25,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {8990#false} assume 0 == main_~assert__arg~3#1 % 256; {8990#false} is VALID [2022-02-20 18:50:25,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {8990#false} assume !false; {8990#false} is VALID [2022-02-20 18:50:25,310 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:25,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:25,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841124510] [2022-02-20 18:50:25,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841124510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:25,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:25,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:25,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22017075] [2022-02-20 18:50:25,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:25,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:25,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:25,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:25,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:25,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:25,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:25,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:25,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:25,342 INFO L87 Difference]: Start difference. First operand 467 states and 692 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:26,495 INFO L93 Difference]: Finished difference Result 1315 states and 1973 transitions. [2022-02-20 18:50:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2022-02-20 18:50:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2022-02-20 18:50:26,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 345 transitions. [2022-02-20 18:50:26,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:26,745 INFO L225 Difference]: With dead ends: 1315 [2022-02-20 18:50:26,746 INFO L226 Difference]: Without dead ends: 871 [2022-02-20 18:50:26,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:26,747 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 552 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:26,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 133 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-20 18:50:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 866. [2022-02-20 18:50:27,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:27,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 871 states. Second operand has 866 states, 864 states have (on average 1.4953703703703705) internal successors, (1292), 865 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call 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:27,485 INFO L74 IsIncluded]: Start isIncluded. First operand 871 states. Second operand has 866 states, 864 states have (on average 1.4953703703703705) internal successors, (1292), 865 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call 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:27,486 INFO L87 Difference]: Start difference. First operand 871 states. Second operand has 866 states, 864 states have (on average 1.4953703703703705) internal successors, (1292), 865 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call 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:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,514 INFO L93 Difference]: Finished difference Result 871 states and 1295 transitions. [2022-02-20 18:50:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1295 transitions. [2022-02-20 18:50:27,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 866 states, 864 states have (on average 1.4953703703703705) internal successors, (1292), 865 states have internal predecessors, (1292), 0 states have call successors, (0), 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 871 states. [2022-02-20 18:50:27,518 INFO L87 Difference]: Start difference. First operand has 866 states, 864 states have (on average 1.4953703703703705) internal successors, (1292), 865 states have internal predecessors, (1292), 0 states have call successors, (0), 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 871 states. [2022-02-20 18:50:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:27,542 INFO L93 Difference]: Finished difference Result 871 states and 1295 transitions. [2022-02-20 18:50:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1295 transitions. [2022-02-20 18:50:27,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:27,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:27,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:27,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4953703703703705) internal successors, (1292), 865 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call 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:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1292 transitions. [2022-02-20 18:50:27,575 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1292 transitions. Word has length 51 [2022-02-20 18:50:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:27,576 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1292 transitions. [2022-02-20 18:50:27,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1292 transitions. [2022-02-20 18:50:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:27,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:27,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:27,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:27,577 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash 323435980, now seen corresponding path program 1 times [2022-02-20 18:50:27,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:27,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543051439] [2022-02-20 18:50:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:27,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {13699#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {13701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {13701#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {13701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {13701#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {13701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {13701#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {13701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {13701#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {13701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {13701#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {13701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {13701#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {13701#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:27,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {13701#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {13702#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:27,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {13702#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {13702#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:27,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {13702#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {13703#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:27,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {13703#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {13700#false} is VALID [2022-02-20 18:50:27,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {13700#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {13700#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {13700#false} is VALID [2022-02-20 18:50:27,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {13700#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {13700#false} is VALID [2022-02-20 18:50:27,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {13700#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {13700#false} is VALID [2022-02-20 18:50:27,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {13700#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13700#false} is VALID [2022-02-20 18:50:27,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {13700#false} assume !(~r1~0 >= 3); {13700#false} is VALID [2022-02-20 18:50:27,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {13700#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {13700#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~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; {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {13700#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {13700#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {13700#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {13700#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {13700#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {13700#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {13700#false} assume main_~node2__m2~1#1 != ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {13700#false} assume !(main_~node2__m2~1#1 > ~id2~0); {13700#false} is VALID [2022-02-20 18:50:27,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {13700#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {13700#false} is VALID [2022-02-20 18:50:27,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {13700#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {13700#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {13700#false} is VALID [2022-02-20 18:50:27,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {13700#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {13700#false} is VALID [2022-02-20 18:50:27,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {13700#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {13700#false} is VALID [2022-02-20 18:50:27,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {13700#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {13700#false} is VALID [2022-02-20 18:50:27,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {13700#false} assume !(~r1~0 >= 3); {13700#false} is VALID [2022-02-20 18:50:27,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {13700#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {13700#false} is VALID [2022-02-20 18:50:27,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {13700#false} assume 0 == main_~assert__arg~3#1 % 256; {13700#false} is VALID [2022-02-20 18:50:27,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {13700#false} assume !false; {13700#false} is VALID [2022-02-20 18:50:27,653 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:27,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:27,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543051439] [2022-02-20 18:50:27,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543051439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:27,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:27,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:27,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316552676] [2022-02-20 18:50:27,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:50:27,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:27,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:27,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:27,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:27,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:27,683 INFO L87 Difference]: Start difference. First operand 866 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:29,004 INFO L93 Difference]: Finished difference Result 1705 states and 2556 transitions. [2022-02-20 18:50:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:29,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:50:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 248 transitions. [2022-02-20 18:50:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 248 transitions. [2022-02-20 18:50:29,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 248 transitions. [2022-02-20 18:50:29,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:29,185 INFO L225 Difference]: With dead ends: 1705 [2022-02-20 18:50:29,185 INFO L226 Difference]: Without dead ends: 866 [2022-02-20 18:50:29,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:29,189 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 361 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:29,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 88 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-02-20 18:50:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2022-02-20 18:50:30,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:30,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 866 states. Second operand has 866 states, 864 states have (on average 1.4733796296296295) internal successors, (1273), 865 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call 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:30,140 INFO L74 IsIncluded]: Start isIncluded. First operand 866 states. Second operand has 866 states, 864 states have (on average 1.4733796296296295) internal successors, (1273), 865 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call 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:30,142 INFO L87 Difference]: Start difference. First operand 866 states. Second operand has 866 states, 864 states have (on average 1.4733796296296295) internal successors, (1273), 865 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call 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:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:30,164 INFO L93 Difference]: Finished difference Result 866 states and 1273 transitions. [2022-02-20 18:50:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1273 transitions. [2022-02-20 18:50:30,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:30,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:30,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 866 states, 864 states have (on average 1.4733796296296295) internal successors, (1273), 865 states have internal predecessors, (1273), 0 states have call successors, (0), 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 866 states. [2022-02-20 18:50:30,168 INFO L87 Difference]: Start difference. First operand has 866 states, 864 states have (on average 1.4733796296296295) internal successors, (1273), 865 states have internal predecessors, (1273), 0 states have call successors, (0), 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 866 states. [2022-02-20 18:50:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:30,192 INFO L93 Difference]: Finished difference Result 866 states and 1273 transitions. [2022-02-20 18:50:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1273 transitions. [2022-02-20 18:50:30,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:30,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:30,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:30,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4733796296296295) internal successors, (1273), 865 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call 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:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1273 transitions. [2022-02-20 18:50:30,222 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1273 transitions. Word has length 52 [2022-02-20 18:50:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:30,223 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1273 transitions. [2022-02-20 18:50:30,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1273 transitions. [2022-02-20 18:50:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:50:30,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:30,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:30,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:30,224 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash 549255064, now seen corresponding path program 1 times [2022-02-20 18:50:30,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:30,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228438654] [2022-02-20 18:50:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:30,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:30,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {18939#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {18941#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:30,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {18941#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {18942#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:30,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {18942#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {18942#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:30,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {18942#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {18943#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:30,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {18943#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {18940#false} is VALID [2022-02-20 18:50:30,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {18940#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {18940#false} is VALID [2022-02-20 18:50:30,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {18940#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18940#false} is VALID [2022-02-20 18:50:30,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {18940#false} assume !(~r1~0 >= 3); {18940#false} is VALID [2022-02-20 18:50:30,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {18940#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {18940#false} is VALID [2022-02-20 18:50:30,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {18940#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~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; {18940#false} is VALID [2022-02-20 18:50:30,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {18940#false} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {18940#false} is VALID [2022-02-20 18:50:30,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {18940#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {18940#false} is VALID [2022-02-20 18:50:30,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {18940#false} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {18940#false} is VALID [2022-02-20 18:50:30,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {18940#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {18940#false} is VALID [2022-02-20 18:50:30,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {18940#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {18940#false} is VALID [2022-02-20 18:50:30,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {18940#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {18940#false} is VALID [2022-02-20 18:50:30,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {18940#false} assume main_~node2__m2~1#1 != ~nomsg~0; {18940#false} is VALID [2022-02-20 18:50:30,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {18940#false} assume !(main_~node2__m2~1#1 > ~id2~0); {18940#false} is VALID [2022-02-20 18:50:30,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {18940#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {18940#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {18940#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {18940#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {18940#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {18940#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {18940#false} assume !(~r1~0 >= 3); {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {18940#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {18940#false} is VALID [2022-02-20 18:50:30,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {18940#false} assume 0 == main_~assert__arg~3#1 % 256; {18940#false} is VALID [2022-02-20 18:50:30,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {18940#false} assume !false; {18940#false} is VALID [2022-02-20 18:50:30,286 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:30,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:30,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228438654] [2022-02-20 18:50:30,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228438654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:30,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:30,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:30,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995371967] [2022-02-20 18:50:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:30,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:50:30,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:30,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:30,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:30,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:30,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:30,319 INFO L87 Difference]: Start difference. First operand 866 states and 1273 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:31,773 INFO L93 Difference]: Finished difference Result 1701 states and 2514 transitions. [2022-02-20 18:50:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:50:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2022-02-20 18:50:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2022-02-20 18:50:31,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 240 transitions. [2022-02-20 18:50:31,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:31,954 INFO L225 Difference]: With dead ends: 1701 [2022-02-20 18:50:31,954 INFO L226 Difference]: Without dead ends: 866 [2022-02-20 18:50:31,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:31,956 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 343 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:31,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 96 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-02-20 18:50:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2022-02-20 18:50:33,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:33,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 866 states. Second operand has 866 states, 864 states have (on average 1.4513888888888888) internal successors, (1254), 865 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call 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:33,174 INFO L74 IsIncluded]: Start isIncluded. First operand 866 states. Second operand has 866 states, 864 states have (on average 1.4513888888888888) internal successors, (1254), 865 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call 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:33,175 INFO L87 Difference]: Start difference. First operand 866 states. Second operand has 866 states, 864 states have (on average 1.4513888888888888) internal successors, (1254), 865 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call 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:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:33,199 INFO L93 Difference]: Finished difference Result 866 states and 1254 transitions. [2022-02-20 18:50:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1254 transitions. [2022-02-20 18:50:33,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:33,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:33,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 866 states, 864 states have (on average 1.4513888888888888) internal successors, (1254), 865 states have internal predecessors, (1254), 0 states have call successors, (0), 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 866 states. [2022-02-20 18:50:33,203 INFO L87 Difference]: Start difference. First operand has 866 states, 864 states have (on average 1.4513888888888888) internal successors, (1254), 865 states have internal predecessors, (1254), 0 states have call successors, (0), 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 866 states. [2022-02-20 18:50:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:33,225 INFO L93 Difference]: Finished difference Result 866 states and 1254 transitions. [2022-02-20 18:50:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1254 transitions. [2022-02-20 18:50:33,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:33,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:33,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:33,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4513888888888888) internal successors, (1254), 865 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call 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:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1254 transitions. [2022-02-20 18:50:33,256 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1254 transitions. Word has length 53 [2022-02-20 18:50:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:33,256 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1254 transitions. [2022-02-20 18:50:33,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1254 transitions. [2022-02-20 18:50:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:50:33,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:33,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:33,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:33,258 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash -680909608, now seen corresponding path program 1 times [2022-02-20 18:50:33,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:33,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237447711] [2022-02-20 18:50:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:33,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {24174#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {24176#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:33,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {24176#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0; {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {24177#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {24178#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {24178#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {24178#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:33,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {24178#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:33,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {24179#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {24180#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:50:33,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {24180#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24181#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:33,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {24181#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24181#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:33,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {24181#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~send3~0 != ~nomsg~0; {24181#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:33,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {24181#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {24182#(or (and (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256))) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256)) (- 256)) ~p2_new~0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 1) |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} is VALID [2022-02-20 18:50:33,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {24182#(or (and (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256))) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256)) (- 256)) ~p2_new~0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 1) |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:33,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:33,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(~r1~0 >= 3); {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:33,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:33,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~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; {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:33,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:33,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:33,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {24183#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24184#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} is VALID [2022-02-20 18:50:33,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {24184#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {24185#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:33,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {24185#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {24185#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:33,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {24185#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {24185#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:33,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {24185#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {24185#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:33,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {24185#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {24185#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:33,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {24185#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {24185#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:33,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {24185#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {24185#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:33,592 INFO L290 TraceCheckUtils]: 46: Hoare triple {24185#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24186#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:50:33,592 INFO L290 TraceCheckUtils]: 47: Hoare triple {24186#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {24175#false} is VALID [2022-02-20 18:50:33,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {24175#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {24175#false} is VALID [2022-02-20 18:50:33,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {24175#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {24175#false} is VALID [2022-02-20 18:50:33,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {24175#false} assume !(~r1~0 >= 3); {24175#false} is VALID [2022-02-20 18:50:33,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {24175#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {24175#false} is VALID [2022-02-20 18:50:33,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {24175#false} assume 0 == main_~assert__arg~3#1 % 256; {24175#false} is VALID [2022-02-20 18:50:33,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {24175#false} assume !false; {24175#false} is VALID [2022-02-20 18:50:33,593 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:33,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:33,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237447711] [2022-02-20 18:50:33,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237447711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:33,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:33,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:33,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406261764] [2022-02-20 18:50:33,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:33,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:50:33,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:33,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:33,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:33,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:50:33,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:50:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:50:33,630 INFO L87 Difference]: Start difference. First operand 866 states and 1254 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:38,871 INFO L93 Difference]: Finished difference Result 2439 states and 3544 transitions. [2022-02-20 18:50:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:50:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:50:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2022-02-20 18:50:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2022-02-20 18:50:38,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 290 transitions. [2022-02-20 18:50:39,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:39,193 INFO L225 Difference]: With dead ends: 2439 [2022-02-20 18:50:39,194 INFO L226 Difference]: Without dead ends: 1678 [2022-02-20 18:50:39,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:50:39,202 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 784 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:39,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [784 Valid, 314 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:50:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2022-02-20 18:50:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 866. [2022-02-20 18:50:41,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:41,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1678 states. Second operand has 866 states, 864 states have (on average 1.4444444444444444) internal successors, (1248), 865 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call 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:41,108 INFO L74 IsIncluded]: Start isIncluded. First operand 1678 states. Second operand has 866 states, 864 states have (on average 1.4444444444444444) internal successors, (1248), 865 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call 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:41,108 INFO L87 Difference]: Start difference. First operand 1678 states. Second operand has 866 states, 864 states have (on average 1.4444444444444444) internal successors, (1248), 865 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call 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:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,189 INFO L93 Difference]: Finished difference Result 1678 states and 2420 transitions. [2022-02-20 18:50:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2420 transitions. [2022-02-20 18:50:41,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 866 states, 864 states have (on average 1.4444444444444444) internal successors, (1248), 865 states have internal predecessors, (1248), 0 states have call successors, (0), 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 1678 states. [2022-02-20 18:50:41,195 INFO L87 Difference]: Start difference. First operand has 866 states, 864 states have (on average 1.4444444444444444) internal successors, (1248), 865 states have internal predecessors, (1248), 0 states have call successors, (0), 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 1678 states. [2022-02-20 18:50:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,271 INFO L93 Difference]: Finished difference Result 1678 states and 2420 transitions. [2022-02-20 18:50:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2420 transitions. [2022-02-20 18:50:41,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:41,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4444444444444444) internal successors, (1248), 865 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call 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:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1248 transitions. [2022-02-20 18:50:41,301 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1248 transitions. Word has length 54 [2022-02-20 18:50:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:41,301 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1248 transitions. [2022-02-20 18:50:41,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1248 transitions. [2022-02-20 18:50:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:50:41,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:41,302 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:41,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:50:41,302 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1013391184, now seen corresponding path program 1 times [2022-02-20 18:50:41,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:41,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208928387] [2022-02-20 18:50:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:41,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {32119#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {32121#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:41,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {32121#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {32122#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {32123#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {32123#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {32123#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:50:41,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {32123#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:50:41,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {32124#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {32125#(and (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))} is VALID [2022-02-20 18:50:41,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {32125#(and (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {32126#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:41,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {32126#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32126#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:41,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {32126#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 >= 3); {32126#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:41,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {32126#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {32126#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:41,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {32126#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~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; {32126#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:41,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {32126#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {32126#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:41,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {32126#(not (= ~p3_old~0 ~nomsg~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {32126#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:50:41,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {32126#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {32127#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:50:41,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {32127#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {32120#false} is VALID [2022-02-20 18:50:41,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {32120#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {32120#false} is VALID [2022-02-20 18:50:41,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {32120#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {32120#false} is VALID [2022-02-20 18:50:41,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {32120#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {32120#false} is VALID [2022-02-20 18:50:41,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {32120#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {32120#false} is VALID [2022-02-20 18:50:41,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {32120#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {32120#false} is VALID [2022-02-20 18:50:41,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {32120#false} assume main_~node3__m3~1#1 != ~nomsg~0; {32120#false} is VALID [2022-02-20 18:50:41,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {32120#false} assume !(main_~node3__m3~1#1 > ~id3~0); {32120#false} is VALID [2022-02-20 18:50:41,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {32120#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {32120#false} is VALID [2022-02-20 18:50:41,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {32120#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {32120#false} is VALID [2022-02-20 18:50:41,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {32120#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32120#false} is VALID [2022-02-20 18:50:41,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {32120#false} assume !(~r1~0 >= 3); {32120#false} is VALID [2022-02-20 18:50:41,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {32120#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {32120#false} is VALID [2022-02-20 18:50:41,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {32120#false} assume 0 == main_~assert__arg~3#1 % 256; {32120#false} is VALID [2022-02-20 18:50:41,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {32120#false} assume !false; {32120#false} is VALID [2022-02-20 18:50:41,448 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:41,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:41,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208928387] [2022-02-20 18:50:41,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208928387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:41,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:41,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:50:41,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761494929] [2022-02-20 18:50:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:50:41,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:41,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:41,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:50:41,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:41,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:50:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:50:41,481 INFO L87 Difference]: Start difference. First operand 866 states and 1248 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,316 INFO L93 Difference]: Finished difference Result 2391 states and 3487 transitions. [2022-02-20 18:50:47,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:50:47,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:50:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2022-02-20 18:50:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2022-02-20 18:50:47,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 294 transitions. [2022-02-20 18:50:47,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:47,639 INFO L225 Difference]: With dead ends: 2391 [2022-02-20 18:50:47,639 INFO L226 Difference]: Without dead ends: 1627 [2022-02-20 18:50:47,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:50:47,640 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 795 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:47,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 239 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2022-02-20 18:50:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 866. [2022-02-20 18:50:50,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:50,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1627 states. Second operand has 866 states, 864 states have (on average 1.443287037037037) internal successors, (1247), 865 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,305 INFO L74 IsIncluded]: Start isIncluded. First operand 1627 states. Second operand has 866 states, 864 states have (on average 1.443287037037037) internal successors, (1247), 865 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,305 INFO L87 Difference]: Start difference. First operand 1627 states. Second operand has 866 states, 864 states have (on average 1.443287037037037) internal successors, (1247), 865 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,382 INFO L93 Difference]: Finished difference Result 1627 states and 2362 transitions. [2022-02-20 18:50:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2362 transitions. [2022-02-20 18:50:50,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 866 states, 864 states have (on average 1.443287037037037) internal successors, (1247), 865 states have internal predecessors, (1247), 0 states have call successors, (0), 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 1627 states. [2022-02-20 18:50:50,386 INFO L87 Difference]: Start difference. First operand has 866 states, 864 states have (on average 1.443287037037037) internal successors, (1247), 865 states have internal predecessors, (1247), 0 states have call successors, (0), 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 1627 states. [2022-02-20 18:50:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,462 INFO L93 Difference]: Finished difference Result 1627 states and 2362 transitions. [2022-02-20 18:50:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2362 transitions. [2022-02-20 18:50:50,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:50,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.443287037037037) internal successors, (1247), 865 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1247 transitions. [2022-02-20 18:50:50,493 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1247 transitions. Word has length 54 [2022-02-20 18:50:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:50,493 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1247 transitions. [2022-02-20 18:50:50,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1247 transitions. [2022-02-20 18:50:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:50:50,494 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:50,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:50,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:50:50,494 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2026548830, now seen corresponding path program 1 times [2022-02-20 18:50:50,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:50,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682016333] [2022-02-20 18:50:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:50,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {39864#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {39866#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:50:50,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {39866#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {39867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {39867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0; {39867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {39867#(and (<= (+ ~nomsg~0 1) 0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {39868#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {39868#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {39868#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {39868#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= ~id1~0 (+ ~nomsg~0 128)) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:50:50,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {39869#(and (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {39870#(and (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 256 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127))))} is VALID [2022-02-20 18:50:50,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {39870#(and (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 256 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127))))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} assume ~send2~0 != ~nomsg~0; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} assume ~send3~0 != ~nomsg~0; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {39871#(not (= ~nomsg~0 ~p1_new~0))} is VALID [2022-02-20 18:50:50,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {39871#(not (= ~nomsg~0 ~p1_new~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume !(~r1~0 >= 3); {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~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; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume !(main_~node1__m1~1#1 > ~id1~0); {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {39872#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:50:50,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {39872#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {39873#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {39873#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {39865#false} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {39865#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {39865#false} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {39865#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {39865#false} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 47: Hoare triple {39865#false} assume main_~node3__m3~1#1 != ~nomsg~0; {39865#false} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 48: Hoare triple {39865#false} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {39865#false} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {39865#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {39865#false} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {39865#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {39865#false} is VALID [2022-02-20 18:50:50,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {39865#false} assume !(~r1~0 >= 3); {39865#false} is VALID [2022-02-20 18:50:50,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {39865#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {39865#false} is VALID [2022-02-20 18:50:50,687 INFO L290 TraceCheckUtils]: 53: Hoare triple {39865#false} assume 0 == main_~assert__arg~3#1 % 256; {39865#false} is VALID [2022-02-20 18:50:50,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {39865#false} assume !false; {39865#false} is VALID [2022-02-20 18:50:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:50,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:50,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682016333] [2022-02-20 18:50:50,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682016333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:50,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:50,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 18:50:50,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615265560] [2022-02-20 18:50:50,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:50,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:50:50,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:50,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 18:50:50,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 18:50:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 18:50:50,725 INFO L87 Difference]: Start difference. First operand 866 states and 1247 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:55,769 INFO L93 Difference]: Finished difference Result 1844 states and 2662 transitions. [2022-02-20 18:50:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:50:55,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:50:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 302 transitions. [2022-02-20 18:50:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 302 transitions. [2022-02-20 18:50:55,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 302 transitions. [2022-02-20 18:50:55,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:56,028 INFO L225 Difference]: With dead ends: 1844 [2022-02-20 18:50:56,028 INFO L226 Difference]: Without dead ends: 1068 [2022-02-20 18:50:56,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:50:56,030 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 879 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:56,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 392 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:50:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-02-20 18:50:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 866. [2022-02-20 18:50:58,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:58,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1068 states. Second operand has 866 states, 864 states have (on average 1.4398148148148149) internal successors, (1244), 865 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call 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:58,817 INFO L74 IsIncluded]: Start isIncluded. First operand 1068 states. Second operand has 866 states, 864 states have (on average 1.4398148148148149) internal successors, (1244), 865 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call 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:58,818 INFO L87 Difference]: Start difference. First operand 1068 states. Second operand has 866 states, 864 states have (on average 1.4398148148148149) internal successors, (1244), 865 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call 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:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,849 INFO L93 Difference]: Finished difference Result 1068 states and 1523 transitions. [2022-02-20 18:50:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1523 transitions. [2022-02-20 18:50:58,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:58,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:58,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 866 states, 864 states have (on average 1.4398148148148149) internal successors, (1244), 865 states have internal predecessors, (1244), 0 states have call successors, (0), 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 1068 states. [2022-02-20 18:50:58,852 INFO L87 Difference]: Start difference. First operand has 866 states, 864 states have (on average 1.4398148148148149) internal successors, (1244), 865 states have internal predecessors, (1244), 0 states have call successors, (0), 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 1068 states. [2022-02-20 18:50:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:58,884 INFO L93 Difference]: Finished difference Result 1068 states and 1523 transitions. [2022-02-20 18:50:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1523 transitions. [2022-02-20 18:50:58,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:58,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:58,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:58,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.4398148148148149) internal successors, (1244), 865 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call 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:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1244 transitions. [2022-02-20 18:50:58,914 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1244 transitions. Word has length 55 [2022-02-20 18:50:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:58,914 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1244 transitions. [2022-02-20 18:50:58,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1244 transitions. [2022-02-20 18:50:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:50:58,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:58,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:58,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:50:58,915 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2014195720, now seen corresponding path program 1 times [2022-02-20 18:50:58,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:58,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614973787] [2022-02-20 18:50:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:59,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {45757#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {45757#true} is VALID [2022-02-20 18:50:59,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {45757#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {45759#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:59,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {45759#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume 0 == ~r1~0; {45759#(and (<= ~id1~0 127) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:59,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {45759#(and (<= ~id1~0 127) (<= ~id2~0 127))} assume ~id1~0 >= 0; {45760#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:59,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {45760#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {45760#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:50:59,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {45760#(and (or (not (<= ~id2~0 ~id1~0)) (<= ~id1~0 127)) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {45761#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {45761#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode1~0 % 256; {45761#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {45761#(and (or (not (<= ~id2~0 ~id1~0)) (and (<= ~send1~0 127) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)))) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 >= 0; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st2~0; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send2~0 == ~id2~0; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode2~0 % 256; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id3~0 >= 0; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~st3~0; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send3~0 == ~id3~0; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 == ~mode3~0 % 256; {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {45762#(and (<= ~send1~0 (+ ~id2~0 127)) (or (not (<= (+ ~id2~0 1) ~id1~0)) (<= ~id1~0 ~send1~0)) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id2~0; {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id1~0 != ~id3~0; {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~send1~0 != ~nomsg~0; {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} is VALID [2022-02-20 18:50:59,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {45763#(and (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~send1~0 (+ ~id2~0 127)) (<= ~id1~0 ~send1~0)) (not (<= ~id2~0 ~id1~0))) (<= 0 ~id2~0) (or (and (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0)) (<= ~id2~0 ~id1~0)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {45764#(and (or (and (or (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ ~id2~0 127))) (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0)))) (not (<= ~id2~0 ~id1~0))) (or (and (or (<= ~id2~0 (+ 127 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (or (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| ~id1~0) (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:50:59,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {45764#(and (or (and (or (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ ~id2~0 127))) (or (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0)))) (not (<= ~id2~0 ~id1~0))) (or (and (or (<= ~id2~0 (+ 127 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (or (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| ~id1~0) (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= ~id2~0 ~id1~0)) (<= 0 ~id2~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send2~0 != ~nomsg~0; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~send3~0 != ~nomsg~0; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {45765#(or (and (or (<= (+ ~id2~0 129) ~p1_new~0) (<= ~id2~0 ~id1~0)) (or (and (<= ~id1~0 ~p1_new~0) (<= (+ ~id2~0 1) ~id1~0)) (< ~id1~0 ~id2~0))) (<= (+ ~p1_new~0 1) ~id2~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(~r1~0 >= 3); {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~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; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~node1__m1~1#1 != ~nomsg~0; {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume !(main_~node1__m1~1#1 > ~id1~0); {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} is VALID [2022-02-20 18:50:59,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {45766#(or (<= (+ ~p1_old~0 1) ~id2~0) (and (or (<= (+ ~id2~0 129) ~p1_old~0) (<= ~id2~0 ~id1~0)) (or (< ~id1~0 ~id2~0) (and (<= (+ ~id2~0 1) ~id1~0) (<= ~id1~0 ~p1_old~0)))))} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {45767#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {45767#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {45767#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:50:59,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {45767#(or (<= (+ ~id2~0 1) ~p1_old~0) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {45768#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:59,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {45768#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume main_~node2__m2~1#1 != ~nomsg~0; {45768#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {45768#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 1) |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 > ~id2~0); {45769#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {45769#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {45758#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {45758#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {45758#false} assume main_~node3__m3~1#1 != ~nomsg~0; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {45758#false} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {45758#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 52: Hoare triple {45758#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1719~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1719~0;~__tmp_1622_0~0 := main_~main____CPAchecker_TMP_0~0#1; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 53: Hoare triple {45758#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_1622_0~0;havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {45758#false} is VALID [2022-02-20 18:50:59,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {45758#false} assume 0 == main_~assert__arg~2#1 % 256; {45758#false} is VALID [2022-02-20 18:50:59,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {45758#false} assume !false; {45758#false} is VALID [2022-02-20 18:50:59,372 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:59,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:59,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614973787] [2022-02-20 18:50:59,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614973787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:59,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:59,372 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 18:50:59,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861312783] [2022-02-20 18:50:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-20 18:50:59,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:59,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:59,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:59,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:50:59,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:50:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:50:59,428 INFO L87 Difference]: Start difference. First operand 866 states and 1244 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,129 INFO L93 Difference]: Finished difference Result 2303 states and 3349 transitions. [2022-02-20 18:51:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:51:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-20 18:51:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 454 transitions. [2022-02-20 18:51:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 454 transitions. [2022-02-20 18:51:12,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 454 transitions. [2022-02-20 18:51:12,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,718 INFO L225 Difference]: With dead ends: 2303 [2022-02-20 18:51:12,718 INFO L226 Difference]: Without dead ends: 1939 [2022-02-20 18:51:12,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:51:12,719 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 1056 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:12,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 1278 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-02-20 18:51:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 833. [2022-02-20 18:51:16,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:16,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1939 states. Second operand has 833 states, 831 states have (on average 1.4416365824308062) internal successors, (1198), 832 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,881 INFO L74 IsIncluded]: Start isIncluded. First operand 1939 states. Second operand has 833 states, 831 states have (on average 1.4416365824308062) internal successors, (1198), 832 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,882 INFO L87 Difference]: Start difference. First operand 1939 states. Second operand has 833 states, 831 states have (on average 1.4416365824308062) internal successors, (1198), 832 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:16,982 INFO L93 Difference]: Finished difference Result 1939 states and 2814 transitions. [2022-02-20 18:51:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2814 transitions. [2022-02-20 18:51:16,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:16,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:16,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 833 states, 831 states have (on average 1.4416365824308062) internal successors, (1198), 832 states have internal predecessors, (1198), 0 states have call successors, (0), 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 1939 states. [2022-02-20 18:51:16,985 INFO L87 Difference]: Start difference. First operand has 833 states, 831 states have (on average 1.4416365824308062) internal successors, (1198), 832 states have internal predecessors, (1198), 0 states have call successors, (0), 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 1939 states. [2022-02-20 18:51:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:17,089 INFO L93 Difference]: Finished difference Result 1939 states and 2814 transitions. [2022-02-20 18:51:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2814 transitions. [2022-02-20 18:51:17,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:17,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:17,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:17,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.4416365824308062) internal successors, (1198), 832 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1198 transitions. [2022-02-20 18:51:17,118 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1198 transitions. Word has length 56 [2022-02-20 18:51:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:17,118 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1198 transitions. [2022-02-20 18:51:17,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1198 transitions. [2022-02-20 18:51:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:51:17,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:17,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:17,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:17,119 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1797287643, now seen corresponding path program 1 times [2022-02-20 18:51:17,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:17,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427430738] [2022-02-20 18:51:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:17,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {53977#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1484~0 := 0;~__return_1551~0 := 0;~__tmp_1560_0~0 := 0;~__return_1621~0 := 0;~__tmp_1622_0~0 := 0;~__return_1564~0 := 0;~__return_1700~0 := 0;~__return_1719~0 := 0; {53977#true} is VALID [2022-02-20 18:51:17,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {53977#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {53979#(and (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} is VALID [2022-02-20 18:51:17,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {53979#(and (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} assume 0 == ~r1~0; {53979#(and (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} is VALID [2022-02-20 18:51:17,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {53979#(and (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} assume ~id1~0 >= 0; {53980#(and (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} is VALID [2022-02-20 18:51:17,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {53980#(and (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} assume 0 == ~st1~0; {53980#(and (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} is VALID [2022-02-20 18:51:17,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {53980#(and (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~send1~0 127)) (or (not (<= ~id1~0 ~id3~0)) (<= ~id3~0 (+ ~send1~0 255))))} assume ~send1~0 == ~id1~0; {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} is VALID [2022-02-20 18:51:17,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} assume 0 == ~mode1~0 % 256; {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} is VALID [2022-02-20 18:51:17,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} assume ~id2~0 >= 0; {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} is VALID [2022-02-20 18:51:17,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} assume 0 == ~st2~0; {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} is VALID [2022-02-20 18:51:17,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} assume ~send2~0 == ~id2~0; {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} is VALID [2022-02-20 18:51:17,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} assume 0 == ~mode2~0 % 256; {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} is VALID [2022-02-20 18:51:17,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {53981#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= 0 ~id1~0) (or (<= ~id1~0 ~id3~0) (<= ~id1~0 127)))} assume ~id3~0 >= 0; {53982#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} is VALID [2022-02-20 18:51:17,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {53982#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} assume 0 == ~st3~0; {53982#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} is VALID [2022-02-20 18:51:17,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {53982#(and (<= ~id3~0 (+ 255 ~id1~0)) (<= ~id1~0 (+ ~id3~0 127)) (<= 0 ~id1~0))} assume ~send3~0 == ~id3~0; {53983#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {53983#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume 0 == ~mode3~0 % 256; {53983#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {53983#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~id1~0 != ~id2~0; {53983#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {53983#(and (<= 0 ~id1~0) (<= ~send3~0 (+ 255 ~id1~0)) (or (<= ~id3~0 ~send3~0) (not (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~id1~0 != ~id3~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~send1~0 != ~nomsg~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~send2~0 != ~nomsg~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~send3~0 != ~nomsg~0; {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} is VALID [2022-02-20 18:51:17,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {53984#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (<= ~send3~0 (+ 255 ~id1~0)) (<= ~id3~0 ~send3~0) (<= (+ ~id1~0 1) ~id3~0))) (or (and (<= ~send3~0 ~id3~0) (<= ~id1~0 (+ ~send3~0 127))) (<= ~id1~0 ~id3~0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {53985#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (or (and (<= ~id3~0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= (+ ~id1~0 1) ~id3~0)) (not (<= (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 0))) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ 255 ~id1~0)))) (or (<= ~id1~0 ~id3~0) (and (or (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~id3~0) (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (<= ~id1~0 (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127))))))} is VALID [2022-02-20 18:51:17,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {53985#(and (<= 0 ~id1~0) (or (not (<= ~id1~0 ~id3~0)) (and (or (and (<= ~id3~0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= (+ ~id1~0 1) ~id3~0)) (not (<= (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 0))) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ 255 ~id1~0)))) (or (<= ~id1~0 ~id3~0) (and (or (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~id3~0) (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (<= ~id1~0 (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127))))))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:17,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:17,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(~r1~0 >= 3); {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:17,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:17,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_1484~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1484~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; {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:17,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:17,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:17,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {53986#(or (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) ~p3_old~0)) (or (and (<= (+ ~id1~0 1) ~id3~0) (<= ~id3~0 ~p3_old~0)) (< ~id3~0 ~id1~0))) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {53987#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|)) (or (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (< ~id3~0 ~id1~0))))} is VALID [2022-02-20 18:51:17,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {53987#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|)) (or (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (< ~id3~0 ~id1~0))))} assume main_~node1__m1~1#1 != ~nomsg~0; {53987#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|)) (or (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (< ~id3~0 ~id1~0))))} is VALID [2022-02-20 18:51:17,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {53987#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (and (or (<= ~id1~0 ~id3~0) (<= (+ ~id1~0 129) |ULTIMATE.start_main_~node1__m1~1#1|)) (or (and (<= ~id3~0 |ULTIMATE.start_main_~node1__m1~1#1|) (<= (+ ~id1~0 1) ~id3~0)) (< ~id3~0 ~id1~0))))} assume !(main_~node1__m1~1#1 > ~id1~0); {53988#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {53988#(<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {53978#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {53978#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {53978#false} assume main_~node2__m2~1#1 != ~nomsg~0; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {53978#false} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {53978#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {53978#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {53978#false} assume main_~node3__m3~1#1 != ~nomsg~0; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {53978#false} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {53978#false} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {53978#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {53978#false} is VALID [2022-02-20 18:51:17,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {53978#false} assume !(~r1~0 >= 3); {53978#false} is VALID [2022-02-20 18:51:17,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {53978#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1700~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1700~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {53978#false} is VALID [2022-02-20 18:51:17,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {53978#false} assume 0 == main_~assert__arg~3#1 % 256; {53978#false} is VALID [2022-02-20 18:51:17,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {53978#false} assume !false; {53978#false} is VALID [2022-02-20 18:51:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:17,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:17,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427430738] [2022-02-20 18:51:17,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427430738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:17,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:17,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:51:17,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473682917] [2022-02-20 18:51:17,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-02-20 18:51:17,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:17,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:17,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:17,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:17,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:17,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:17,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:17,562 INFO L87 Difference]: Start difference. First operand 833 states and 1198 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)