./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.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-var-start-time.3.2.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 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:44:26,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:44:26,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:44:26,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:44:26,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:44:26,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:44:26,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:44:26,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:44:26,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:44:26,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:44:26,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:44:26,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:44:26,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:44:26,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:44:26,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:44:26,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:44:26,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:44:26,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:44:26,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:44:26,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:44:26,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:44:26,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:44:26,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:44:26,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:44:26,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:44:26,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:44:26,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:44:26,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:44:26,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:44:26,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:44:26,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:44:26,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:44:26,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:44:26,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:44:26,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:44:26,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:44:26,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:44:26,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:44:26,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:44:26,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:44:26,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:44:26,129 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:44:26,149 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:44:26,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:44:26,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:44:26,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:44:26,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:44:26,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:44:26,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:44:26,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:44:26,154 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:44:26,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:44:26,155 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:44:26,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:44:26,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:44:26,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:44:26,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:44:26,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:44:26,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:44:26,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:26,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:44:26,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:44:26,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:44:26,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:44:26,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:44:26,158 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:44:26,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:44:26,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:44:26,159 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 -> 2f774b3e755d7b6f786f7d23823d008ce09be620750647481355094233fd1ac8 [2022-02-20 18:44:26,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:44:26,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:44:26,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:44:26,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:44:26,322 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:44:26,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:44:26,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29721d64/49779f7fba4944d4bc468518e47210e9/FLAG79ffa4020 [2022-02-20 18:44:26,759 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:44:26,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:44:26,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29721d64/49779f7fba4944d4bc468518e47210e9/FLAG79ffa4020 [2022-02-20 18:44:26,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29721d64/49779f7fba4944d4bc468518e47210e9 [2022-02-20 18:44:26,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:44:26,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:44:26,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:26,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:44:26,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:44:26,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:26" (1/1) ... [2022-02-20 18:44:26,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186efecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:26, skipping insertion in model container [2022-02-20 18:44:26,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:44:26" (1/1) ... [2022-02-20 18:44:26,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:44:26,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:44:27,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2022-02-20 18:44:27,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:27,088 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:44:27,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7471,7484] [2022-02-20 18:44:27,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:44:27,167 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:44:27,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27 WrapperNode [2022-02-20 18:44:27,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:44:27,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:27,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:44:27,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:44:27,173 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:44:27" (1/1) ... [2022-02-20 18:44:27,191 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:44:27" (1/1) ... [2022-02-20 18:44:27,238 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 574 [2022-02-20 18:44:27,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:44:27,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:44:27,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:44:27,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:44:27,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:44:27,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:44:27,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:44:27,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:44:27,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (1/1) ... [2022-02-20 18:44:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:44:27,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:44:27,325 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:44:27,337 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:44:27,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:44:27,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:44:27,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:44:27,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:44:27,424 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:44:27,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:44:27,861 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:44:27,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:44:27,867 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:44:27,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:27 BoogieIcfgContainer [2022-02-20 18:44:27,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:44:27,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:44:27,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:44:27,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:44:27,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:44:26" (1/3) ... [2022-02-20 18:44:27,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b6344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:27, skipping insertion in model container [2022-02-20 18:44:27,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:44:27" (2/3) ... [2022-02-20 18:44:27,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b6344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:44:27, skipping insertion in model container [2022-02-20 18:44:27,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:44:27" (3/3) ... [2022-02-20 18:44:27,873 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-02-20 18:44:27,876 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:44:27,876 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:44:27,904 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:44:27,908 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:44:27,908 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:44:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:44:27,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:27,962 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:44:27,962 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1935961454, now seen corresponding path program 1 times [2022-02-20 18:44:27,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:27,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123161382] [2022-02-20 18:44:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:28,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {151#true} is VALID [2022-02-20 18:44:28,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {151#true} is VALID [2022-02-20 18:44:28,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} assume 0 == ~r1~0; {151#true} is VALID [2022-02-20 18:44:28,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {151#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {151#true} is VALID [2022-02-20 18:44:28,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#true} assume ~id1~0 >= 0; {151#true} is VALID [2022-02-20 18:44:28,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#true} assume 0 == ~st1~0; {153#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:28,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {153#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:28,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {153#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:28,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {153#(<= ~st1~0 0)} assume ~id2~0 >= 0; {153#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:28,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {153#(<= ~st1~0 0)} assume 0 == ~st2~0; {154#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {154#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {154#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {154#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {154#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {154#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {154#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {155#(<= (+ ~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; {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:28,383 INFO L290 TraceCheckUtils]: 45: Hoare triple {155#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {152#false} is VALID [2022-02-20 18:44:28,383 INFO L290 TraceCheckUtils]: 46: Hoare triple {152#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {152#false} is VALID [2022-02-20 18:44:28,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {152#false} assume 0 == main_~assert__arg~2#1 % 256; {152#false} is VALID [2022-02-20 18:44:28,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {152#false} assume !false; {152#false} is VALID [2022-02-20 18:44:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:28,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:28,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123161382] [2022-02-20 18:44:28,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123161382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:28,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:28,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:28,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45720889] [2022-02-20 18:44:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:28,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:44:28,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:28,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:44:28,445 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:44:28,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:28,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:28,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:28,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:28,470 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 0 states have call successors, (0), 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.8) internal successors, (49), 5 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:44:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:29,329 INFO L93 Difference]: Finished difference Result 468 states and 757 transitions. [2022-02-20 18:44:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:44:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:44:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 757 transitions. [2022-02-20 18:44:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:44:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 757 transitions. [2022-02-20 18:44:29,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 757 transitions. [2022-02-20 18:44:29,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 757 edges. 757 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:29,834 INFO L225 Difference]: With dead ends: 468 [2022-02-20 18:44:29,834 INFO L226 Difference]: Without dead ends: 394 [2022-02-20 18:44:29,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:29,839 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 829 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:29,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [829 Valid, 867 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-02-20 18:44:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 232. [2022-02-20 18:44:29,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:29,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:29,930 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:29,930 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:29,941 INFO L93 Difference]: Finished difference Result 394 states and 593 transitions. [2022-02-20 18:44:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 593 transitions. [2022-02-20 18:44:29,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:29,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:29,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 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 394 states. [2022-02-20 18:44:29,944 INFO L87 Difference]: Start difference. First operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 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 394 states. [2022-02-20 18:44:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:29,954 INFO L93 Difference]: Finished difference Result 394 states and 593 transitions. [2022-02-20 18:44:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 593 transitions. [2022-02-20 18:44:29,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:29,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:29,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:29,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4891774891774892) internal successors, (344), 231 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 344 transitions. [2022-02-20 18:44:29,962 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 344 transitions. Word has length 49 [2022-02-20 18:44:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:29,962 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 344 transitions. [2022-02-20 18:44:29,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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:44:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 344 transitions. [2022-02-20 18:44:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:29,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:29,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:29,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:44:29,964 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1118200662, now seen corresponding path program 1 times [2022-02-20 18:44:29,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:29,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710403440] [2022-02-20 18:44:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:30,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {1871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {1871#true} is VALID [2022-02-20 18:44:30,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1871#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {1871#true} is VALID [2022-02-20 18:44:30,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1871#true} assume 0 == ~r1~0; {1871#true} is VALID [2022-02-20 18:44:30,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {1871#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {1871#true} is VALID [2022-02-20 18:44:30,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {1871#true} assume ~id1~0 >= 0; {1871#true} is VALID [2022-02-20 18:44:30,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1871#true} assume 0 == ~st1~0; {1871#true} is VALID [2022-02-20 18:44:30,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {1871#true} assume ~send1~0 == ~id1~0; {1871#true} is VALID [2022-02-20 18:44:30,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {1871#true} assume 0 == ~mode1~0 % 256; {1871#true} is VALID [2022-02-20 18:44:30,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {1871#true} assume ~id2~0 >= 0; {1871#true} is VALID [2022-02-20 18:44:30,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {1871#true} assume 0 == ~st2~0; {1871#true} is VALID [2022-02-20 18:44:30,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {1871#true} assume ~send2~0 == ~id2~0; {1871#true} is VALID [2022-02-20 18:44:30,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {1871#true} assume 0 == ~mode2~0 % 256; {1871#true} is VALID [2022-02-20 18:44:30,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {1871#true} assume ~id3~0 >= 0; {1871#true} is VALID [2022-02-20 18:44:30,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {1871#true} assume 0 == ~st3~0; {1871#true} is VALID [2022-02-20 18:44:30,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {1871#true} assume ~send3~0 == ~id3~0; {1871#true} is VALID [2022-02-20 18:44:30,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {1871#true} assume 0 == ~mode3~0 % 256; {1871#true} is VALID [2022-02-20 18:44:30,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {1871#true} assume ~id1~0 != ~id2~0; {1871#true} is VALID [2022-02-20 18:44:30,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {1871#true} assume ~id1~0 != ~id3~0; {1871#true} is VALID [2022-02-20 18:44:30,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {1871#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {1871#true} is VALID [2022-02-20 18:44:30,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1871#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; {1871#true} is VALID [2022-02-20 18:44:30,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1871#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1871#true} is VALID [2022-02-20 18:44:30,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {1871#true} assume !!(0 == ~mode1~0 % 256); {1871#true} is VALID [2022-02-20 18:44:30,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {1871#true} assume !!(0 == ~alive1~0 % 256); {1871#true} is VALID [2022-02-20 18:44:30,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {1871#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1871#true} is VALID [2022-02-20 18:44:30,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {1871#true} assume !!(0 == ~mode2~0 % 256); {1871#true} is VALID [2022-02-20 18:44:30,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {1871#true} assume !!(0 == ~alive2~0 % 256); {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send2~0 != ~id2~0); {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~mode3~0 % 256); {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !!(0 == ~alive3~0 % 256); {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(~send3~0 != ~id3~0); {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~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; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~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; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} is VALID [2022-02-20 18:44:30,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {1873#(= (+ (* (- 256) (div ~alive2~0 256)) ~alive2~0) 0)} assume !(0 == ~alive2~0 % 256); {1872#false} is VALID [2022-02-20 18:44:30,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {1872#false} assume !(main_~node2__m2~1#1 > ~id2~0); {1872#false} is VALID [2022-02-20 18:44:30,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {1872#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {1872#false} is VALID [2022-02-20 18:44:30,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {1872#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {1872#false} is VALID [2022-02-20 18:44:30,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {1872#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1872#false} is VALID [2022-02-20 18:44:30,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {1872#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {1872#false} is VALID [2022-02-20 18:44:30,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {1872#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; {1872#false} is VALID [2022-02-20 18:44:30,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {1872#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {1872#false} is VALID [2022-02-20 18:44:30,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {1872#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {1872#false} is VALID [2022-02-20 18:44:30,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {1872#false} assume 0 == main_~assert__arg~2#1 % 256; {1872#false} is VALID [2022-02-20 18:44:30,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2022-02-20 18:44:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:30,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:30,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710403440] [2022-02-20 18:44:30,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710403440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:30,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:30,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:30,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230773627] [2022-02-20 18:44:30,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:30,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:44:30,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:30,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:30,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:30,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:30,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:30,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:30,076 INFO L87 Difference]: Start difference. First operand 232 states and 344 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:30,392 INFO L93 Difference]: Finished difference Result 570 states and 864 transitions. [2022-02-20 18:44:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:44:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-02-20 18:44:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-02-20 18:44:30,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 487 transitions. [2022-02-20 18:44:30,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:30,700 INFO L225 Difference]: With dead ends: 570 [2022-02-20 18:44:30,701 INFO L226 Difference]: Without dead ends: 402 [2022-02-20 18:44:30,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:30,706 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 141 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:30,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-02-20 18:44:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2022-02-20 18:44:30,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:30,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,844 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,846 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:30,856 INFO L93 Difference]: Finished difference Result 402 states and 596 transitions. [2022-02-20 18:44:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 596 transitions. [2022-02-20 18:44:30,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:30,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:30,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:44:30,862 INFO L87 Difference]: Start difference. First operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 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 402 states. [2022-02-20 18:44:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:30,871 INFO L93 Difference]: Finished difference Result 402 states and 596 transitions. [2022-02-20 18:44:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 596 transitions. [2022-02-20 18:44:30,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:30,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:30,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:30,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.4912280701754386) internal successors, (595), 399 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 595 transitions. [2022-02-20 18:44:30,893 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 595 transitions. Word has length 52 [2022-02-20 18:44:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:30,895 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 595 transitions. [2022-02-20 18:44:30,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 595 transitions. [2022-02-20 18:44:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:30,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:30,899 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:30,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:44:30,899 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1570903849, now seen corresponding path program 1 times [2022-02-20 18:44:30,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:30,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583518592] [2022-02-20 18:44:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:31,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {3956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {3956#true} is VALID [2022-02-20 18:44:31,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {3956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {3956#true} is VALID [2022-02-20 18:44:31,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {3956#true} assume 0 == ~r1~0; {3956#true} is VALID [2022-02-20 18:44:31,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {3956#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {3956#true} is VALID [2022-02-20 18:44:31,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {3956#true} assume ~id1~0 >= 0; {3956#true} is VALID [2022-02-20 18:44:31,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {3956#true} assume 0 == ~st1~0; {3956#true} is VALID [2022-02-20 18:44:31,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {3956#true} assume ~send1~0 == ~id1~0; {3956#true} is VALID [2022-02-20 18:44:31,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {3956#true} assume 0 == ~mode1~0 % 256; {3956#true} is VALID [2022-02-20 18:44:31,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {3956#true} assume ~id2~0 >= 0; {3956#true} is VALID [2022-02-20 18:44:31,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {3956#true} assume 0 == ~st2~0; {3956#true} is VALID [2022-02-20 18:44:31,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {3956#true} assume ~send2~0 == ~id2~0; {3956#true} is VALID [2022-02-20 18:44:31,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {3956#true} assume 0 == ~mode2~0 % 256; {3956#true} is VALID [2022-02-20 18:44:31,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {3956#true} assume ~id3~0 >= 0; {3956#true} is VALID [2022-02-20 18:44:31,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {3956#true} assume 0 == ~st3~0; {3956#true} is VALID [2022-02-20 18:44:31,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {3956#true} assume ~send3~0 == ~id3~0; {3956#true} is VALID [2022-02-20 18:44:31,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {3956#true} assume 0 == ~mode3~0 % 256; {3956#true} is VALID [2022-02-20 18:44:31,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {3956#true} assume ~id1~0 != ~id2~0; {3956#true} is VALID [2022-02-20 18:44:31,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {3956#true} assume ~id1~0 != ~id3~0; {3956#true} is VALID [2022-02-20 18:44:31,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {3956#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {3956#true} is VALID [2022-02-20 18:44:31,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {3956#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; {3956#true} is VALID [2022-02-20 18:44:31,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {3956#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {3956#true} is VALID [2022-02-20 18:44:31,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {3956#true} assume !!(0 == ~mode1~0 % 256); {3956#true} is VALID [2022-02-20 18:44:31,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {3956#true} assume !!(0 == ~alive1~0 % 256); {3956#true} is VALID [2022-02-20 18:44:31,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {3956#true} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {3956#true} is VALID [2022-02-20 18:44:31,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {3956#true} assume !!(0 == ~mode2~0 % 256); {3956#true} is VALID [2022-02-20 18:44:31,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {3956#true} assume !!(0 == ~alive2~0 % 256); {3956#true} is VALID [2022-02-20 18:44:31,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {3956#true} assume !(~send2~0 != ~id2~0); {3956#true} is VALID [2022-02-20 18:44:31,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {3956#true} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {3956#true} is VALID [2022-02-20 18:44:31,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {3956#true} assume !!(0 == ~mode3~0 % 256); {3956#true} is VALID [2022-02-20 18:44:31,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {3956#true} assume !!(0 == ~alive3~0 % 256); {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(~send3~0 != ~id3~0); {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~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; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~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; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} is VALID [2022-02-20 18:44:31,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {3958#(= (+ (* (- 256) (div ~alive3~0 256)) ~alive3~0) 0)} assume !(0 == ~alive3~0 % 256); {3957#false} is VALID [2022-02-20 18:44:31,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {3957#false} assume !(main_~node3__m3~1#1 > ~id3~0); {3957#false} is VALID [2022-02-20 18:44:31,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {3957#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {3957#false} is VALID [2022-02-20 18:44:31,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {3957#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; {3957#false} is VALID [2022-02-20 18:44:31,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {3957#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {3957#false} is VALID [2022-02-20 18:44:31,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {3957#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {3957#false} is VALID [2022-02-20 18:44:31,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {3957#false} assume 0 == main_~assert__arg~2#1 % 256; {3957#false} is VALID [2022-02-20 18:44:31,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {3957#false} assume !false; {3957#false} is VALID [2022-02-20 18:44:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:31,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:31,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583518592] [2022-02-20 18:44:31,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583518592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:31,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:31,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:31,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054428934] [2022-02-20 18:44:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:31,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:44:31,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:31,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:31,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:31,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:31,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:31,053 INFO L87 Difference]: Start difference. First operand 400 states and 595 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:31,480 INFO L93 Difference]: Finished difference Result 980 states and 1475 transitions. [2022-02-20 18:44:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:31,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:44:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:44:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2022-02-20 18:44:31,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 463 transitions. [2022-02-20 18:44:31,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:31,788 INFO L225 Difference]: With dead ends: 980 [2022-02-20 18:44:31,788 INFO L226 Difference]: Without dead ends: 692 [2022-02-20 18:44:31,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:31,790 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 128 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:31,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-02-20 18:44:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2022-02-20 18:44:32,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:32,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 692 states. Second operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,029 INFO L74 IsIncluded]: Start isIncluded. First operand 692 states. Second operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,030 INFO L87 Difference]: Start difference. First operand 692 states. Second operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:32,060 INFO L93 Difference]: Finished difference Result 692 states and 1020 transitions. [2022-02-20 18:44:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1020 transitions. [2022-02-20 18:44:32,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:32,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:32,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 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 692 states. [2022-02-20 18:44:32,064 INFO L87 Difference]: Start difference. First operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 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 692 states. [2022-02-20 18:44:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:32,080 INFO L93 Difference]: Finished difference Result 692 states and 1020 transitions. [2022-02-20 18:44:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1020 transitions. [2022-02-20 18:44:32,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:32,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:32,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:32,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 1.478955007256894) internal successors, (1019), 689 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1019 transitions. [2022-02-20 18:44:32,103 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1019 transitions. Word has length 52 [2022-02-20 18:44:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:32,104 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 1019 transitions. [2022-02-20 18:44:32,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1019 transitions. [2022-02-20 18:44:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:44:32,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:32,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:32,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:44:32,105 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1320706551, now seen corresponding path program 1 times [2022-02-20 18:44:32,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:32,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561445220] [2022-02-20 18:44:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:32,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {7563#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {7563#true} is VALID [2022-02-20 18:44:32,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {7563#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {7563#true} is VALID [2022-02-20 18:44:32,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {7563#true} assume 0 == ~r1~0; {7563#true} is VALID [2022-02-20 18:44:32,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {7563#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {7563#true} is VALID [2022-02-20 18:44:32,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {7563#true} assume ~id1~0 >= 0; {7563#true} is VALID [2022-02-20 18:44:32,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {7563#true} assume 0 == ~st1~0; {7563#true} is VALID [2022-02-20 18:44:32,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {7563#true} assume ~send1~0 == ~id1~0; {7563#true} is VALID [2022-02-20 18:44:32,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {7563#true} assume 0 == ~mode1~0 % 256; {7563#true} is VALID [2022-02-20 18:44:32,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {7563#true} assume ~id2~0 >= 0; {7563#true} is VALID [2022-02-20 18:44:32,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {7563#true} assume 0 == ~st2~0; {7563#true} is VALID [2022-02-20 18:44:32,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {7563#true} assume ~send2~0 == ~id2~0; {7563#true} is VALID [2022-02-20 18:44:32,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {7563#true} assume 0 == ~mode2~0 % 256; {7563#true} is VALID [2022-02-20 18:44:32,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {7563#true} assume ~id3~0 >= 0; {7563#true} is VALID [2022-02-20 18:44:32,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {7563#true} assume 0 == ~st3~0; {7563#true} is VALID [2022-02-20 18:44:32,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {7563#true} assume ~send3~0 == ~id3~0; {7563#true} is VALID [2022-02-20 18:44:32,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {7563#true} assume 0 == ~mode3~0 % 256; {7563#true} is VALID [2022-02-20 18:44:32,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {7563#true} assume ~id1~0 != ~id2~0; {7563#true} is VALID [2022-02-20 18:44:32,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {7563#true} assume ~id1~0 != ~id3~0; {7563#true} is VALID [2022-02-20 18:44:32,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {7563#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {7563#true} is VALID [2022-02-20 18:44:32,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {7563#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; {7563#true} is VALID [2022-02-20 18:44:32,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {7563#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7563#true} is VALID [2022-02-20 18:44:32,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {7563#true} assume !!(0 == ~mode1~0 % 256); {7563#true} is VALID [2022-02-20 18:44:32,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {7563#true} assume !!(0 == ~alive1~0 % 256); {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode2~0 % 256); {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive2~0 % 256); {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send2~0 != ~id2~0); {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~mode3~0 % 256); {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !!(0 == ~alive3~0 % 256); {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(~send3~0 != ~id3~0); {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 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; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 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; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} is VALID [2022-02-20 18:44:32,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {7565#(= (+ ~alive1~0 (* (- 256) (div ~alive1~0 256))) 0)} assume !(0 == ~alive1~0 % 256); {7564#false} is VALID [2022-02-20 18:44:32,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {7564#false} assume !(main_~node1__m1~1#1 > ~id1~0); {7564#false} is VALID [2022-02-20 18:44:32,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {7564#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {7564#false} is VALID [2022-02-20 18:44:32,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {7564#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {7564#false} is VALID [2022-02-20 18:44:32,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {7564#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {7564#false} is VALID [2022-02-20 18:44:32,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {7564#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {7564#false} is VALID [2022-02-20 18:44:32,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {7564#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {7564#false} is VALID [2022-02-20 18:44:32,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {7564#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {7564#false} is VALID [2022-02-20 18:44:32,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {7564#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {7564#false} is VALID [2022-02-20 18:44:32,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {7564#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; {7564#false} is VALID [2022-02-20 18:44:32,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {7564#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {7564#false} is VALID [2022-02-20 18:44:32,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {7564#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {7564#false} is VALID [2022-02-20 18:44:32,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {7564#false} assume 0 == main_~assert__arg~2#1 % 256; {7564#false} is VALID [2022-02-20 18:44:32,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {7564#false} assume !false; {7564#false} is VALID [2022-02-20 18:44:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:32,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:32,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561445220] [2022-02-20 18:44:32,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561445220] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:32,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:32,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:44:32,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515081833] [2022-02-20 18:44:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:32,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:44:32,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:32,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:32,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:44:32,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:44:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:32,219 INFO L87 Difference]: Start difference. First operand 690 states and 1019 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:32,880 INFO L93 Difference]: Finished difference Result 1813 states and 2684 transitions. [2022-02-20 18:44:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:44:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:44:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2022-02-20 18:44:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2022-02-20 18:44:32,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 509 transitions. [2022-02-20 18:44:33,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 509 edges. 509 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:33,328 INFO L225 Difference]: With dead ends: 1813 [2022-02-20 18:44:33,328 INFO L226 Difference]: Without dead ends: 1211 [2022-02-20 18:44:33,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:44:33,330 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:33,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 398 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:33,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2022-02-20 18:44:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1209. [2022-02-20 18:44:33,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:33,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1211 states. Second operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,651 INFO L74 IsIncluded]: Start isIncluded. First operand 1211 states. Second operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,653 INFO L87 Difference]: Start difference. First operand 1211 states. Second operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:33,698 INFO L93 Difference]: Finished difference Result 1211 states and 1741 transitions. [2022-02-20 18:44:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1741 transitions. [2022-02-20 18:44:33,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:33,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:33,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 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 1211 states. [2022-02-20 18:44:33,703 INFO L87 Difference]: Start difference. First operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 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 1211 states. [2022-02-20 18:44:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:33,747 INFO L93 Difference]: Finished difference Result 1211 states and 1741 transitions. [2022-02-20 18:44:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1741 transitions. [2022-02-20 18:44:33,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:33,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:33,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:33,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4403973509933774) internal successors, (1740), 1208 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1740 transitions. [2022-02-20 18:44:33,802 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1740 transitions. Word has length 52 [2022-02-20 18:44:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:33,802 INFO L470 AbstractCegarLoop]: Abstraction has 1209 states and 1740 transitions. [2022-02-20 18:44:33,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1740 transitions. [2022-02-20 18:44:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:33,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:33,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:33,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:44:33,804 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1834372633, now seen corresponding path program 1 times [2022-02-20 18:44:33,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:33,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926046647] [2022-02-20 18:44:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:33,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {14028#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {14028#true} is VALID [2022-02-20 18:44:33,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {14028#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {14028#true} is VALID [2022-02-20 18:44:33,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {14028#true} assume 0 == ~r1~0; {14028#true} is VALID [2022-02-20 18:44:33,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {14028#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {14028#true} is VALID [2022-02-20 18:44:33,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {14028#true} assume ~id1~0 >= 0; {14028#true} is VALID [2022-02-20 18:44:33,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {14028#true} assume 0 == ~st1~0; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {14030#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {14030#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {14030#(<= ~st1~0 0)} assume ~id2~0 >= 0; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {14030#(<= ~st1~0 0)} assume 0 == ~st2~0; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {14030#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {14030#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {14030#(<= ~st1~0 0)} assume ~id3~0 >= 0; {14030#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:33,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {14030#(<= ~st1~0 0)} assume 0 == ~st3~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {14031#(<= (+ ~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; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {14031#(<= (+ ~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; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {14031#(<= (+ ~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); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~alive3~0 % 256); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {14031#(<= (+ ~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; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {14031#(<= (+ ~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; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {14031#(<= (+ ~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; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~alive2~0 % 256); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {14031#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:33,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {14031#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {14032#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:33,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {14032#(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; {14032#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:33,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {14032#(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; {14032#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:33,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {14032#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {14032#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:33,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {14032#(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; {14032#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:44:33,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {14032#(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_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {14029#false} is VALID [2022-02-20 18:44:33,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {14029#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {14029#false} is VALID [2022-02-20 18:44:33,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {14029#false} assume 0 == main_~assert__arg~2#1 % 256; {14029#false} is VALID [2022-02-20 18:44:33,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {14029#false} assume !false; {14029#false} is VALID [2022-02-20 18:44:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:33,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:33,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926046647] [2022-02-20 18:44:33,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926046647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:33,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:33,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:33,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977125614] [2022-02-20 18:44:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:33,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:44:33,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:33,883 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), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:33,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:33,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:33,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:33,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:33,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:33,929 INFO L87 Difference]: Start difference. First operand 1209 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:35,298 INFO L93 Difference]: Finished difference Result 2352 states and 3451 transitions. [2022-02-20 18:44:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:35,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:44:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2022-02-20 18:44:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2022-02-20 18:44:35,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 685 transitions. [2022-02-20 18:44:35,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:35,875 INFO L225 Difference]: With dead ends: 2352 [2022-02-20 18:44:35,876 INFO L226 Difference]: Without dead ends: 2006 [2022-02-20 18:44:35,876 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:44:35,877 INFO L933 BasicCegarLoop]: 363 mSDtfsCounter, 557 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:35,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 884 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2022-02-20 18:44:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1614. [2022-02-20 18:44:36,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:36,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2006 states. Second operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,538 INFO L74 IsIncluded]: Start isIncluded. First operand 2006 states. Second operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,539 INFO L87 Difference]: Start difference. First operand 2006 states. Second operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:36,663 INFO L93 Difference]: Finished difference Result 2006 states and 2918 transitions. [2022-02-20 18:44:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2918 transitions. [2022-02-20 18:44:36,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:36,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:36,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 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 2006 states. [2022-02-20 18:44:36,669 INFO L87 Difference]: Start difference. First operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 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 2006 states. [2022-02-20 18:44:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:36,780 INFO L93 Difference]: Finished difference Result 2006 states and 2918 transitions. [2022-02-20 18:44:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2918 transitions. [2022-02-20 18:44:36,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:36,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:36,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:36,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.4476131432114072) internal successors, (2335), 1613 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2335 transitions. [2022-02-20 18:44:36,892 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2335 transitions. Word has length 53 [2022-02-20 18:44:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:36,892 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 2335 transitions. [2022-02-20 18:44:36,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2335 transitions. [2022-02-20 18:44:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:44:36,893 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:36,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:36,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:44:36,894 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1785989049, now seen corresponding path program 1 times [2022-02-20 18:44:36,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:36,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046973564] [2022-02-20 18:44:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:36,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {23430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {23430#true} is VALID [2022-02-20 18:44:36,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {23430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {23430#true} is VALID [2022-02-20 18:44:36,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {23430#true} assume 0 == ~r1~0; {23430#true} is VALID [2022-02-20 18:44:36,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {23430#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {23430#true} is VALID [2022-02-20 18:44:36,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {23430#true} assume ~id1~0 >= 0; {23430#true} is VALID [2022-02-20 18:44:36,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {23430#true} assume 0 == ~st1~0; {23432#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:36,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {23432#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {23432#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:36,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {23432#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {23432#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:36,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {23432#(<= ~st1~0 0)} assume ~id2~0 >= 0; {23432#(<= ~st1~0 0)} is VALID [2022-02-20 18:44:36,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {23432#(<= ~st1~0 0)} assume 0 == ~st2~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {23433#(<= (+ ~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; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {23433#(<= (+ ~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; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive1~0 % 256); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~alive2~0 % 256); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {23433#(<= (+ ~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); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {23433#(<= (+ ~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; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {23433#(<= (+ ~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; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {23433#(<= (+ ~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; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:36,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:37,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:37,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:37,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~alive3~0 % 256); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:37,000 INFO L290 TraceCheckUtils]: 46: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {23433#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:44:37,001 INFO L290 TraceCheckUtils]: 47: Hoare triple {23433#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {23434#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:44:37,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {23434#(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; {23434#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:44:37,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {23434#(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_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {23431#false} is VALID [2022-02-20 18:44:37,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {23431#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {23431#false} is VALID [2022-02-20 18:44:37,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {23431#false} assume 0 == main_~assert__arg~2#1 % 256; {23431#false} is VALID [2022-02-20 18:44:37,002 INFO L290 TraceCheckUtils]: 52: Hoare triple {23431#false} assume !false; {23431#false} is VALID [2022-02-20 18:44:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:37,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:37,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046973564] [2022-02-20 18:44:37,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046973564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:37,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:37,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:37,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519531941] [2022-02-20 18:44:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:37,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:44:37,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:37,003 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), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:37,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:37,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:37,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:37,034 INFO L87 Difference]: Start difference. First operand 1614 states and 2335 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:38,560 INFO L93 Difference]: Finished difference Result 2726 states and 4001 transitions. [2022-02-20 18:44:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:38,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:44:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2022-02-20 18:44:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2022-02-20 18:44:38,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 685 transitions. [2022-02-20 18:44:38,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:39,135 INFO L225 Difference]: With dead ends: 2726 [2022-02-20 18:44:39,136 INFO L226 Difference]: Without dead ends: 2380 [2022-02-20 18:44:39,136 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:44:39,137 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 561 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:39,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 915 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:44:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-02-20 18:44:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1925. [2022-02-20 18:44:39,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:39,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2380 states. Second operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,909 INFO L74 IsIncluded]: Start isIncluded. First operand 2380 states. Second operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:39,910 INFO L87 Difference]: Start difference. First operand 2380 states. Second operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:40,058 INFO L93 Difference]: Finished difference Result 2380 states and 3468 transitions. [2022-02-20 18:44:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3468 transitions. [2022-02-20 18:44:40,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:40,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:40,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 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 2380 states. [2022-02-20 18:44:40,064 INFO L87 Difference]: Start difference. First operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 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 2380 states. [2022-02-20 18:44:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:40,230 INFO L93 Difference]: Finished difference Result 2380 states and 3468 transitions. [2022-02-20 18:44:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3468 transitions. [2022-02-20 18:44:40,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:40,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:40,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:40,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4527027027027026) internal successors, (2795), 1924 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2795 transitions. [2022-02-20 18:44:40,399 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2795 transitions. Word has length 53 [2022-02-20 18:44:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:40,399 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 2795 transitions. [2022-02-20 18:44:40,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2795 transitions. [2022-02-20 18:44:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:44:40,401 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:40,401 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:44:40,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:44:40,401 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:40,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1176645599, now seen corresponding path program 1 times [2022-02-20 18:44:40,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:40,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953339849] [2022-02-20 18:44:40,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:40,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {34532#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {34532#true} is VALID [2022-02-20 18:44:40,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {34532#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {34532#true} is VALID [2022-02-20 18:44:40,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {34532#true} assume 0 == ~r1~0; {34532#true} is VALID [2022-02-20 18:44:40,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {34532#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {34532#true} is VALID [2022-02-20 18:44:40,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {34532#true} assume ~id1~0 >= 0; {34532#true} is VALID [2022-02-20 18:44:40,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {34532#true} assume 0 == ~st1~0; {34532#true} is VALID [2022-02-20 18:44:40,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {34532#true} assume ~send1~0 == ~id1~0; {34532#true} is VALID [2022-02-20 18:44:40,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {34532#true} assume 0 == ~mode1~0 % 256; {34532#true} is VALID [2022-02-20 18:44:40,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {34532#true} assume ~id2~0 >= 0; {34532#true} is VALID [2022-02-20 18:44:40,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {34532#true} assume 0 == ~st2~0; {34534#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:40,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {34534#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {34534#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:40,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {34534#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {34534#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:40,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {34534#(<= ~st2~0 0)} assume ~id3~0 >= 0; {34534#(<= ~st2~0 0)} is VALID [2022-02-20 18:44:40,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {34534#(<= ~st2~0 0)} assume 0 == ~st3~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {34535#(<= (+ ~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; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {34535#(<= (+ ~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; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {34535#(<= (+ ~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); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive2~0 % 256); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~id2~0); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~alive3~0 % 256); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~id3~0); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {34535#(<= (+ ~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; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {34535#(<= (+ ~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; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {34535#(<= (+ ~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; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~alive1~0 % 256); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {34535#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:44:40,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {34535#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {34536#(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; {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {34536#(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; {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {34536#(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; {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {34536#(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; {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {34536#(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; {34536#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:44:40,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {34536#(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_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {34533#false} is VALID [2022-02-20 18:44:40,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {34533#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {34533#false} is VALID [2022-02-20 18:44:40,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {34533#false} assume 0 == main_~assert__arg~2#1 % 256; {34533#false} is VALID [2022-02-20 18:44:40,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {34533#false} assume !false; {34533#false} is VALID [2022-02-20 18:44:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:40,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:40,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953339849] [2022-02-20 18:44:40,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953339849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:40,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:40,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:44:40,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773418456] [2022-02-20 18:44:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:40,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:44:40,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:40,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:44:40,503 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:44:40,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:40,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:40,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:40,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:40,504 INFO L87 Difference]: Start difference. First operand 1925 states and 2795 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:44:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:42,652 INFO L93 Difference]: Finished difference Result 3143 states and 4614 transitions. [2022-02-20 18:44:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:42,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:44:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:44:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2022-02-20 18:44:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:44:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2022-02-20 18:44:42,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 685 transitions. [2022-02-20 18:44:42,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:43,209 INFO L225 Difference]: With dead ends: 3143 [2022-02-20 18:44:43,210 INFO L226 Difference]: Without dead ends: 2797 [2022-02-20 18:44:43,211 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:44:43,211 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 565 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:43,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 989 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2022-02-20 18:44:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2223. [2022-02-20 18:44:44,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:44,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2797 states. Second operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,078 INFO L74 IsIncluded]: Start isIncluded. First operand 2797 states. Second operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,080 INFO L87 Difference]: Start difference. First operand 2797 states. Second operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:44,275 INFO L93 Difference]: Finished difference Result 2797 states and 4081 transitions. [2022-02-20 18:44:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4081 transitions. [2022-02-20 18:44:44,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:44,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:44,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 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 2797 states. [2022-02-20 18:44:44,282 INFO L87 Difference]: Start difference. First operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 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 2797 states. [2022-02-20 18:44:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:44,486 INFO L93 Difference]: Finished difference Result 2797 states and 4081 transitions. [2022-02-20 18:44:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4081 transitions. [2022-02-20 18:44:44,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:44,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:44,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:44,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2222 states have (on average 1.4572457245724573) internal successors, (3238), 2222 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3238 transitions. [2022-02-20 18:44:44,683 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3238 transitions. Word has length 54 [2022-02-20 18:44:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:44,684 INFO L470 AbstractCegarLoop]: Abstraction has 2223 states and 3238 transitions. [2022-02-20 18:44:44,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:44:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3238 transitions. [2022-02-20 18:44:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 18:44:44,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:44,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:44,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:44:44,685 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1625242146, now seen corresponding path program 1 times [2022-02-20 18:44:44,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:44,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615237341] [2022-02-20 18:44:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:44,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:44,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {47465#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {47467#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:44,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {47467#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {47468#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:44,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {47468#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {47468#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:44:44,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {47468#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {47469#(<= (+ ~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; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {47469#(<= (+ ~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; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256); {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~alive1~0 % 256); {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256); {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {47469#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:44:44,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {47469#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {47466#false} is VALID [2022-02-20 18:44:44,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {47466#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); {47466#false} is VALID [2022-02-20 18:44:44,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {47466#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {47466#false} assume !!(0 == ~mode3~0 % 256); {47466#false} is VALID [2022-02-20 18:44:44,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {47466#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {47466#false} is VALID [2022-02-20 18:44:44,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {47466#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {47466#false} is VALID [2022-02-20 18:44:44,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {47466#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); {47466#false} is VALID [2022-02-20 18:44:44,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {47466#false} ~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; {47466#false} is VALID [2022-02-20 18:44:44,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {47466#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {47466#false} is VALID [2022-02-20 18:44:44,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {47466#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {47466#false} is VALID [2022-02-20 18:44:44,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {47466#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; {47466#false} is VALID [2022-02-20 18:44:44,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {47466#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {47466#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; {47466#false} is VALID [2022-02-20 18:44:44,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {47466#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {47466#false} is VALID [2022-02-20 18:44:44,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {47466#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {47466#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {47466#false} assume main_~node2__m2~1#1 != ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {47466#false} assume !(0 == ~alive2~0 % 256); {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 44: Hoare triple {47466#false} assume !(main_~node2__m2~1#1 > ~id2~0); {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 45: Hoare triple {47466#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {47466#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {47466#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {47466#false} assume main_~node3__m3~1#1 != ~nomsg~0; {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {47466#false} assume !(0 == ~alive3~0 % 256); {47466#false} is VALID [2022-02-20 18:44:44,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {47466#false} assume !(main_~node3__m3~1#1 > ~id3~0); {47466#false} is VALID [2022-02-20 18:44:44,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {47466#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {47466#false} is VALID [2022-02-20 18:44:44,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {47466#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; {47466#false} is VALID [2022-02-20 18:44:44,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {47466#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {47466#false} is VALID [2022-02-20 18:44:44,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {47466#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {47466#false} is VALID [2022-02-20 18:44:44,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {47466#false} assume 0 == main_~assert__arg~2#1 % 256; {47466#false} is VALID [2022-02-20 18:44:44,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {47466#false} assume !false; {47466#false} is VALID [2022-02-20 18:44:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:44,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:44,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615237341] [2022-02-20 18:44:44,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615237341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:44,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:44,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:44,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729624238] [2022-02-20 18:44:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:44,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:44:44,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:44,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:44,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:44,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:44,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:44,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:44,786 INFO L87 Difference]: Start difference. First operand 2223 states and 3238 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:49,721 INFO L93 Difference]: Finished difference Result 5276 states and 7686 transitions. [2022-02-20 18:44:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:44:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-02-20 18:44:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:44:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2022-02-20 18:44:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2022-02-20 18:44:49,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 495 transitions. [2022-02-20 18:44:50,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:50,462 INFO L225 Difference]: With dead ends: 5276 [2022-02-20 18:44:50,462 INFO L226 Difference]: Without dead ends: 3095 [2022-02-20 18:44:50,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:44:50,465 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 795 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:44:50,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [795 Valid, 207 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:44:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-02-20 18:44:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3077. [2022-02-20 18:44:54,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:44:54,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3095 states. Second operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:54,313 INFO L74 IsIncluded]: Start isIncluded. First operand 3095 states. Second operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:54,316 INFO L87 Difference]: Start difference. First operand 3095 states. Second operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:54,602 INFO L93 Difference]: Finished difference Result 3095 states and 4461 transitions. [2022-02-20 18:44:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 4461 transitions. [2022-02-20 18:44:54,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:54,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:54,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 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 3095 states. [2022-02-20 18:44:54,610 INFO L87 Difference]: Start difference. First operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 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 3095 states. [2022-02-20 18:44:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:44:54,890 INFO L93 Difference]: Finished difference Result 3095 states and 4461 transitions. [2022-02-20 18:44:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 4461 transitions. [2022-02-20 18:44:54,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:44:54,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:44:54,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:44:54,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:44:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.4447334200260078) internal successors, (4444), 3076 states have internal predecessors, (4444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4444 transitions. [2022-02-20 18:44:55,319 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4444 transitions. Word has length 57 [2022-02-20 18:44:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:44:55,319 INFO L470 AbstractCegarLoop]: Abstraction has 3077 states and 4444 transitions. [2022-02-20 18:44:55,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4444 transitions. [2022-02-20 18:44:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:44:55,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:44:55,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:44:55,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:44:55,321 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:44:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:44:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1198136650, now seen corresponding path program 1 times [2022-02-20 18:44:55,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:44:55,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556085921] [2022-02-20 18:44:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:44:55,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:44:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:44:55,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {65087#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {65089#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:55,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {65089#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {65089#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:55,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {65089#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {65089#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:55,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {65089#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {65089#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:44:55,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {65089#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {65090#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:55,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {65090#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {65090#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:44:55,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {65090#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {65091#(<= (+ ~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; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {65091#(<= (+ ~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; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256); {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == ~alive1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {65091#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:44:55,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {65091#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {65088#false} is VALID [2022-02-20 18:44:55,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {65088#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); {65088#false} is VALID [2022-02-20 18:44:55,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {65088#false} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {65088#false} assume !!(0 == ~mode2~0 % 256); {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {65088#false} assume !!(0 == ~alive2~0 % 256); {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {65088#false} assume !(~send2~0 != ~id2~0); {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {65088#false} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {65088#false} assume !!(0 == ~mode3~0 % 256); {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {65088#false} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {65088#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {65088#false} is VALID [2022-02-20 18:44:55,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {65088#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); {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {65088#false} ~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; {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {65088#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {65088#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {65088#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; {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {65088#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {65088#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; {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {65088#false} assume main_~node1__m1~1#1 != ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {65088#false} assume !(0 == ~alive1~0 % 256); {65088#false} is VALID [2022-02-20 18:44:55,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {65088#false} assume !(main_~node1__m1~1#1 > ~id1~0); {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {65088#false} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {65088#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {65088#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {65088#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {65088#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {65088#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {65088#false} assume main_~node3__m3~1#1 != ~nomsg~0; {65088#false} is VALID [2022-02-20 18:44:55,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {65088#false} assume !(0 == ~alive3~0 % 256); {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {65088#false} assume !(main_~node3__m3~1#1 > ~id3~0); {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {65088#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {65088#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; {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {65088#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {65088#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {65088#false} assume 0 == main_~assert__arg~2#1 % 256; {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {65088#false} assume !false; {65088#false} is VALID [2022-02-20 18:44:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:44:55,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:44:55,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556085921] [2022-02-20 18:44:55,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556085921] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:44:55,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:44:55,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:44:55,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028704749] [2022-02-20 18:44:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:44:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:44:55,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:44:55,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:44:55,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:44:55,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:44:55,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:44:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:44:55,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:44:55,416 INFO L87 Difference]: Start difference. First operand 3077 states and 4444 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:02,796 INFO L93 Difference]: Finished difference Result 7194 states and 10361 transitions. [2022-02-20 18:45:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:02,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:45:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-02-20 18:45:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-02-20 18:45:02,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 499 transitions. [2022-02-20 18:45:03,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 499 edges. 499 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:03,818 INFO L225 Difference]: With dead ends: 7194 [2022-02-20 18:45:03,819 INFO L226 Difference]: Without dead ends: 4204 [2022-02-20 18:45:03,821 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:45:03,822 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 792 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:03,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 197 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2022-02-20 18:45:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3077. [2022-02-20 18:45:08,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:08,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4204 states. Second operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,109 INFO L74 IsIncluded]: Start isIncluded. First operand 4204 states. Second operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,112 INFO L87 Difference]: Start difference. First operand 4204 states. Second operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:08,648 INFO L93 Difference]: Finished difference Result 4204 states and 5970 transitions. [2022-02-20 18:45:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 5970 transitions. [2022-02-20 18:45:08,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:08,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:08,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 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 4204 states. [2022-02-20 18:45:08,658 INFO L87 Difference]: Start difference. First operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 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 4204 states. [2022-02-20 18:45:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:09,157 INFO L93 Difference]: Finished difference Result 4204 states and 5970 transitions. [2022-02-20 18:45:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 5970 transitions. [2022-02-20 18:45:09,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:09,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:09,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:09,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:09,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.428478543563069) internal successors, (4394), 3076 states have internal predecessors, (4394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4394 transitions. [2022-02-20 18:45:09,578 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4394 transitions. Word has length 58 [2022-02-20 18:45:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:09,578 INFO L470 AbstractCegarLoop]: Abstraction has 3077 states and 4394 transitions. [2022-02-20 18:45:09,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4394 transitions. [2022-02-20 18:45:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:45:09,580 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:09,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:09,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:45:09,580 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash -153913959, now seen corresponding path program 1 times [2022-02-20 18:45:09,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:09,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014354574] [2022-02-20 18:45:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:09,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {87609#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {87611#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:09,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {87611#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {87612#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:09,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {87612#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {87612#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:45:09,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {87612#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {87613#(<= (+ ~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; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {87613#(<= (+ ~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; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256); {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~alive1~0 % 256); {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256); {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {87613#(<= (+ ~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); {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256); {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {87613#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:45:09,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {87613#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {87610#false} is VALID [2022-02-20 18:45:09,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {87610#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); {87610#false} is VALID [2022-02-20 18:45:09,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {87610#false} ~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; {87610#false} is VALID [2022-02-20 18:45:09,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {87610#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {87610#false} is VALID [2022-02-20 18:45:09,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {87610#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {87610#false} is VALID [2022-02-20 18:45:09,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {87610#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; {87610#false} is VALID [2022-02-20 18:45:09,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {87610#false} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {87610#false} is VALID [2022-02-20 18:45:09,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {87610#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; {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {87610#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {87610#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {87610#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {87610#false} assume main_~node2__m2~1#1 != ~nomsg~0; {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {87610#false} assume !(0 == ~alive2~0 % 256); {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 45: Hoare triple {87610#false} assume !(main_~node2__m2~1#1 > ~id2~0); {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {87610#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {87610#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {87610#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {87610#false} is VALID [2022-02-20 18:45:09,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {87610#false} assume main_~node3__m3~1#1 != ~nomsg~0; {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {87610#false} assume !(0 == ~alive3~0 % 256); {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 51: Hoare triple {87610#false} assume !(main_~node3__m3~1#1 > ~id3~0); {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {87610#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {87610#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; {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {87610#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 55: Hoare triple {87610#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {87610#false} assume 0 == main_~assert__arg~2#1 % 256; {87610#false} is VALID [2022-02-20 18:45:09,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {87610#false} assume !false; {87610#false} is VALID [2022-02-20 18:45:09,713 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:45:09,713 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:09,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014354574] [2022-02-20 18:45:09,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014354574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:09,713 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:09,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:45:09,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316581274] [2022-02-20 18:45:09,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:09,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:45:09,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:09,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:09,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:09,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:45:09,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:09,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:45:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:45:09,766 INFO L87 Difference]: Start difference. First operand 3077 states and 4394 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:19,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:19,448 INFO L93 Difference]: Finished difference Result 7259 states and 10357 transitions. [2022-02-20 18:45:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:45:19,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:45:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:45:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-02-20 18:45:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2022-02-20 18:45:19,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 459 transitions. [2022-02-20 18:45:19,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:20,480 INFO L225 Difference]: With dead ends: 7259 [2022-02-20 18:45:20,480 INFO L226 Difference]: Without dead ends: 4260 [2022-02-20 18:45:20,483 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:45:20,483 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 737 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:45:20,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [737 Valid, 209 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:45:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2022-02-20 18:45:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 4235. [2022-02-20 18:45:25,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:45:25,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4260 states. Second operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:25,320 INFO L74 IsIncluded]: Start isIncluded. First operand 4260 states. Second operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:25,322 INFO L87 Difference]: Start difference. First operand 4260 states. Second operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:25,826 INFO L93 Difference]: Finished difference Result 4260 states and 6003 transitions. [2022-02-20 18:45:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 6003 transitions. [2022-02-20 18:45:25,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:25,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:25,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 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 4260 states. [2022-02-20 18:45:25,836 INFO L87 Difference]: Start difference. First operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 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 4260 states. [2022-02-20 18:45:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:45:26,352 INFO L93 Difference]: Finished difference Result 4260 states and 6003 transitions. [2022-02-20 18:45:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 6003 transitions. [2022-02-20 18:45:26,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:45:26,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:45:26,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:45:26,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:45:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4235 states, 4234 states have (on average 1.4121398205007085) internal successors, (5979), 4234 states have internal predecessors, (5979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 5979 transitions. [2022-02-20 18:45:27,056 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 5979 transitions. Word has length 58 [2022-02-20 18:45:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:45:27,056 INFO L470 AbstractCegarLoop]: Abstraction has 4235 states and 5979 transitions. [2022-02-20 18:45:27,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:27,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 5979 transitions. [2022-02-20 18:45:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:45:27,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:45:27,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:45:27,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:45:27,058 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:45:27,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:45:27,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1572096567, now seen corresponding path program 1 times [2022-02-20 18:45:27,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:45:27,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315606212] [2022-02-20 18:45:27,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:45:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:45:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:45:27,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {111971#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(65, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_6067~0 := 0;~__return_6144~0 := 0;~__return_6207~0 := 0;~__tmp_6234_0~0 := 0;~__return_6276~0 := 0;~__tmp_6277_0~0 := 0;~__return_6290~0 := 0;~__return_6445~0 := 0; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~3#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____CPAchecker_TMP_1~0#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~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____CPAchecker_TMP_1~1#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~init__tmp~0#1; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {111973#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:45:27,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {111973#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode2~0 % 256; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id3~0 >= 0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st3~0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send3~0 == ~id3~0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~mode3~0 % 256; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id2~0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id1~0 != ~id3~0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_6067~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_6067~0; {111974#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {111974#(<= (+ ~nomsg~0 1) ~id2~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; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode1~0 % 256); {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~alive1~0 % 256); {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} ~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode2~0 % 256); {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send2~0 != ~nomsg~0; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {111975#(<= (+ ~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); {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} ~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume !!(0 == ~mode3~0 % 256); {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume !(0 == ~alive3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~send3~0 != ~nomsg~0; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {111975#(<= (+ ~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); {111975#(<= (+ ~p1_new~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {111975#(<= (+ ~p1_new~0 1) ~id2~0)} ~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1;~__return_6144~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_6144~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; {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {111976#(<= (+ ~p1_old~0 1) ~id2~0)} is VALID [2022-02-20 18:45:27,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {111976#(<= (+ ~p1_old~0 1) ~id2~0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:27,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 != ~nomsg~0; {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:27,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(0 == ~alive2~0 % 256); {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:27,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume !(main_~node2__m2~1#1 > ~id2~0); {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} is VALID [2022-02-20 18:45:27,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {111977#(<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {111972#false} is VALID [2022-02-20 18:45:27,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {111972#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {111972#false} is VALID [2022-02-20 18:45:27,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {111972#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {111972#false} is VALID [2022-02-20 18:45:27,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {111972#false} assume main_~node3__m3~1#1 != ~nomsg~0; {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {111972#false} assume !(0 == ~alive3~0 % 256); {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 52: Hoare triple {111972#false} assume !(main_~node3__m3~1#1 > ~id3~0); {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {111972#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {111972#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; {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {111972#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_6445~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_6445~0;~__tmp_6277_0~0 := main_~main____CPAchecker_TMP_0~0#1; {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {111972#false} main_~main____CPAchecker_TMP_0~1#1 := ~__tmp_6277_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; {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {111972#false} assume 0 == main_~assert__arg~2#1 % 256; {111972#false} is VALID [2022-02-20 18:45:27,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {111972#false} assume !false; {111972#false} is VALID [2022-02-20 18:45:27,131 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:45:27,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:45:27,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315606212] [2022-02-20 18:45:27,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315606212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:45:27,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:45:27,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:45:27,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699387172] [2022-02-20 18:45:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:45:27,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-02-20 18:45:27,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:45:27,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:45:27,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:45:27,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:45:27,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:45:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:45:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:45:27,176 INFO L87 Difference]: Start difference. First operand 4235 states and 5979 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)