./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:50:37,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:50:37,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:50:37,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:50:37,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:50:37,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:50:37,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:50:37,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:50:37,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:50:37,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:50:37,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:50:37,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:50:37,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:50:37,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:50:37,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:50:37,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:50:37,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:50:37,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:50:37,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:50:37,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:50:37,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:50:37,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:50:37,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:50:37,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:50:37,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:50:37,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:50:37,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:50:37,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:50:37,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:50:37,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:50:37,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:50:37,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:50:37,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:50:37,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:50:37,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:50:37,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:50:37,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:50:37,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:50:37,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:50:37,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:50:37,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:50:37,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:50:37,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:50:37,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:50:37,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:50:37,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:50:37,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:50:37,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:50:37,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:50:37,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:50:37,637 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:50:37,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:50:37,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:50:37,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:50:37,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:50:37,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:50:37,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:50:37,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:50:37,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:50:37,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:50:37,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:50:37,639 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:50:37,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:50:37,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:50:37,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:50:37,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:50:37,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:37,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:50:37,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:50:37,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:50:37,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:50:37,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:50:37,641 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:50:37,641 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:50:37,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:50:37,641 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 -> 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 [2022-02-20 18:50:37,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:50:37,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:50:37,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:50:37,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:50:37,855 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:50:37,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:50:37,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1736667b/cc3d20e8aa644578acf7ee02fb801651/FLAG450bd15ec [2022-02-20 18:50:38,262 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:50:38,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:50:38,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1736667b/cc3d20e8aa644578acf7ee02fb801651/FLAG450bd15ec [2022-02-20 18:50:38,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1736667b/cc3d20e8aa644578acf7ee02fb801651 [2022-02-20 18:50:38,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:50:38,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:50:38,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:38,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:50:38,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:50:38,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4956225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38, skipping insertion in model container [2022-02-20 18:50:38,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:50:38,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:50:38,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2022-02-20 18:50:38,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2022-02-20 18:50:38,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:38,526 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:50:38,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2022-02-20 18:50:38,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2022-02-20 18:50:38,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:50:38,579 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:50:38,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38 WrapperNode [2022-02-20 18:50:38,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:50:38,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:38,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:50:38,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:50:38,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,651 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 447 [2022-02-20 18:50:38,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:50:38,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:50:38,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:50:38,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:50:38,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:50:38,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:50:38,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:50:38,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:50:38,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (1/1) ... [2022-02-20 18:50:38,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:50:38,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:38,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:50:38,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:50:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:50:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:50:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:50:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:50:38,821 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:50:38,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:50:39,208 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:50:39,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:50:39,217 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:50:39,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:39 BoogieIcfgContainer [2022-02-20 18:50:39,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:50:39,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:50:39,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:50:39,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:50:39,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:50:38" (1/3) ... [2022-02-20 18:50:39,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9fcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:39, skipping insertion in model container [2022-02-20 18:50:39,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:50:38" (2/3) ... [2022-02-20 18:50:39,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9fcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:50:39, skipping insertion in model container [2022-02-20 18:50:39,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:50:39" (3/3) ... [2022-02-20 18:50:39,224 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:50:39,228 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:50:39,228 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 18:50:39,255 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:50:39,259 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:50:39,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 18:50:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 103 states have (on average 1.7475728155339805) internal successors, (180), 105 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:50:39,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:39,276 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] [2022-02-20 18:50:39,276 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1096512752, now seen corresponding path program 1 times [2022-02-20 18:50:39,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:39,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891165378] [2022-02-20 18:50:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:39,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {109#true} is VALID [2022-02-20 18:50:39,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {109#true} is VALID [2022-02-20 18:50:39,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} assume 0 == ~r1~0 % 256; {109#true} is VALID [2022-02-20 18:50:39,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} assume ~id1~0 >= 0; {109#true} is VALID [2022-02-20 18:50:39,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {109#true} assume 0 == ~st1~0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:39,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:39,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:39,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#(<= ~st1~0 0)} assume ~id2~0 >= 0; {111#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:39,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#(<= ~st1~0 0)} assume 0 == ~st2~0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {112#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {112#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 0;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:39,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {113#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~1#1 := 0;~__return_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~0; {110#false} is VALID [2022-02-20 18:50:39,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {110#false} havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~2#1;main_~assert__arg~2#1 := main_~__tmp_3~0#1; {110#false} is VALID [2022-02-20 18:50:39,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {110#false} assume 0 == main_~assert__arg~2#1 % 256; {110#false} is VALID [2022-02-20 18:50:39,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:50:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:39,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:39,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891165378] [2022-02-20 18:50:39,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891165378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:39,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:39,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:39,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401526480] [2022-02-20 18:50:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:39,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-02-20 18:50:39,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:39,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:39,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:39,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:39,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:39,601 INFO L87 Difference]: Start difference. First operand has 106 states, 103 states have (on average 1.7475728155339805) internal successors, (180), 105 states have internal predecessors, (180), 0 states have call successors, (0), 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.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:40,404 INFO L93 Difference]: Finished difference Result 422 states and 668 transitions. [2022-02-20 18:50:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:50:40,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-02-20 18:50:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-02-20 18:50:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-02-20 18:50:40,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 668 transitions. [2022-02-20 18:50:40,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 668 edges. 668 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:40,800 INFO L225 Difference]: With dead ends: 422 [2022-02-20 18:50:40,800 INFO L226 Difference]: Without dead ends: 358 [2022-02-20 18:50:40,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:50:40,823 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 596 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:40,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [596 Valid, 775 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-02-20 18:50:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 156. [2022-02-20 18:50:40,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:40,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 156 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,896 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 156 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,897 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 156 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:40,919 INFO L93 Difference]: Finished difference Result 358 states and 520 transitions. [2022-02-20 18:50:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 520 transitions. [2022-02-20 18:50:40,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:40,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:40,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 0 states have call successors, (0), 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 358 states. [2022-02-20 18:50:40,928 INFO L87 Difference]: Start difference. First operand has 156 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 0 states have call successors, (0), 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 358 states. [2022-02-20 18:50:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:40,938 INFO L93 Difference]: Finished difference Result 358 states and 520 transitions. [2022-02-20 18:50:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 520 transitions. [2022-02-20 18:50:40,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:40,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:40,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:40,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 222 transitions. [2022-02-20 18:50:40,946 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 222 transitions. Word has length 47 [2022-02-20 18:50:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:40,946 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 222 transitions. [2022-02-20 18:50:40,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 222 transitions. [2022-02-20 18:50:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 18:50:40,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:40,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:40,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:50:40,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 191283016, now seen corresponding path program 1 times [2022-02-20 18:50:40,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:40,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329955032] [2022-02-20 18:50:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:40,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:41,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {1598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {1598#true} is VALID [2022-02-20 18:50:41,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1598#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1598#true} is VALID [2022-02-20 18:50:41,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {1598#true} assume 0 == ~r1~0 % 256; {1598#true} is VALID [2022-02-20 18:50:41,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {1598#true} assume ~id1~0 >= 0; {1598#true} is VALID [2022-02-20 18:50:41,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {1598#true} assume 0 == ~st1~0; {1598#true} is VALID [2022-02-20 18:50:41,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1598#true} assume ~send1~0 == ~id1~0; {1598#true} is VALID [2022-02-20 18:50:41,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {1598#true} assume 0 == ~mode1~0 % 256; {1598#true} is VALID [2022-02-20 18:50:41,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {1598#true} assume ~id2~0 >= 0; {1598#true} is VALID [2022-02-20 18:50:41,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {1598#true} assume 0 == ~st2~0; {1598#true} is VALID [2022-02-20 18:50:41,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {1598#true} assume ~send2~0 == ~id2~0; {1598#true} is VALID [2022-02-20 18:50:41,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {1598#true} assume 0 == ~mode2~0 % 256; {1598#true} is VALID [2022-02-20 18:50:41,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {1598#true} assume ~id3~0 >= 0; {1598#true} is VALID [2022-02-20 18:50:41,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {1598#true} assume 0 == ~st3~0; {1598#true} is VALID [2022-02-20 18:50:41,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {1598#true} assume ~send3~0 == ~id3~0; {1598#true} is VALID [2022-02-20 18:50:41,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {1598#true} assume 0 == ~mode3~0 % 256; {1598#true} is VALID [2022-02-20 18:50:41,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {1598#true} assume ~id1~0 != ~id2~0; {1598#true} is VALID [2022-02-20 18:50:41,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1598#true} assume ~id1~0 != ~id3~0; {1598#true} is VALID [2022-02-20 18:50:41,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {1598#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {1598#true} is VALID [2022-02-20 18:50:41,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {1598#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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1598#true} is VALID [2022-02-20 18:50:41,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {1598#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1598#true} is VALID [2022-02-20 18:50:41,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {1598#true} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {1598#true} is VALID [2022-02-20 18:50:41,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {1598#true} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1598#true} is VALID [2022-02-20 18:50:41,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1598#true} is VALID [2022-02-20 18:50:41,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {1598#true} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1598#true} is VALID [2022-02-20 18:50:41,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {1598#true} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1598#true} is VALID [2022-02-20 18:50:41,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {1598#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {1598#true} is VALID [2022-02-20 18:50:41,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1598#true} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {1598#true} is VALID [2022-02-20 18:50:41,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#true} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1598#true} is VALID [2022-02-20 18:50:41,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1598#true} is VALID [2022-02-20 18:50:41,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#true} assume !(~r1~0 % 256 >= 3); {1598#true} is VALID [2022-02-20 18:50:41,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {1598#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {1600#(= (+ ~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; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {1600#(= (+ ~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; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 != ~nomsg~0); {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {1600#(= (+ ~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; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {1600#(= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {1599#false} is VALID [2022-02-20 18:50:41,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {1599#false} assume 0 == main_~assert__arg~3#1 % 256; {1599#false} is VALID [2022-02-20 18:50:41,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {1599#false} assume !false; {1599#false} is VALID [2022-02-20 18:50:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:41,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:41,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329955032] [2022-02-20 18:50:41,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329955032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:41,100 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:41,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:50:41,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753313836] [2022-02-20 18:50:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:41,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:41,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:41,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:50:41,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:41,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:50:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:41,128 INFO L87 Difference]: Start difference. First operand 156 states and 222 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,328 INFO L93 Difference]: Finished difference Result 247 states and 359 transitions. [2022-02-20 18:50:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:50:41,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 18:50:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2022-02-20 18:50:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2022-02-20 18:50:41,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 295 transitions. [2022-02-20 18:50:41,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:41,519 INFO L225 Difference]: With dead ends: 247 [2022-02-20 18:50:41,519 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 18:50:41,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:50:41,523 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 75 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:41,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 305 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 18:50:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-02-20 18:50:41,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:41,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 158 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,571 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 158 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,572 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 158 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,577 INFO L93 Difference]: Finished difference Result 160 states and 224 transitions. [2022-02-20 18:50:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2022-02-20 18:50:41,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 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 160 states. [2022-02-20 18:50:41,579 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 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 160 states. [2022-02-20 18:50:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:41,583 INFO L93 Difference]: Finished difference Result 160 states and 224 transitions. [2022-02-20 18:50:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2022-02-20 18:50:41,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:41,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:41,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:41,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2022-02-20 18:50:41,588 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 48 [2022-02-20 18:50:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:41,589 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2022-02-20 18:50:41,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2022-02-20 18:50:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:41,591 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:41,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:41,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:50:41,591 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:41,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1589815569, now seen corresponding path program 1 times [2022-02-20 18:50:41,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:41,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240177764] [2022-02-20 18:50:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:41,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {2448#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {2448#true} is VALID [2022-02-20 18:50:41,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2448#true} is VALID [2022-02-20 18:50:41,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume 0 == ~r1~0 % 256; {2448#true} is VALID [2022-02-20 18:50:41,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {2448#true} assume ~id1~0 >= 0; {2448#true} is VALID [2022-02-20 18:50:41,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {2448#true} assume 0 == ~st1~0; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {2450#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {2450#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {2450#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {2450#(<= ~st1~0 0)} assume 0 == ~st2~0; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {2450#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {2450#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {2450#(<= ~st1~0 0)} assume ~id3~0 >= 0; {2450#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:41,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {2450#(<= ~st1~0 0)} assume 0 == ~st3~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {2451#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 != ~nomsg~0; {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 > ~id2~0); {2451#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:41,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {2451#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {2452#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:41,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {2452#(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; {2452#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:41,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {2452#(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; {2452#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:41,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {2452#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {2452#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:41,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {2452#(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; {2452#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:41,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {2452#(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_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~0; {2449#false} is VALID [2022-02-20 18:50:41,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {2449#false} 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; {2449#false} is VALID [2022-02-20 18:50:41,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {2449#false} assume 0 == main_~assert__arg~2#1 % 256; {2449#false} is VALID [2022-02-20 18:50:41,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-02-20 18:50:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:41,699 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:41,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240177764] [2022-02-20 18:50:41,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240177764] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:41,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:41,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:41,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962935311] [2022-02-20 18:50:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:41,701 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:50:41,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:41,701 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:50:41,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:41,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:41,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:41,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:41,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:41,736 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. 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:50:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,124 INFO L93 Difference]: Finished difference Result 478 states and 707 transitions. [2022-02-20 18:50:42,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:42,125 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:50:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:42,125 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:50:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 18:50:42,128 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:50:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 18:50:42,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-02-20 18:50:42,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:42,429 INFO L225 Difference]: With dead ends: 478 [2022-02-20 18:50:42,429 INFO L226 Difference]: Without dead ends: 394 [2022-02-20 18:50:42,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:42,430 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 304 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:42,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 542 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-02-20 18:50:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 251. [2022-02-20 18:50:42,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:42,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 251 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 250 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,501 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 251 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 250 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,501 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 251 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 250 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,510 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2022-02-20 18:50:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 575 transitions. [2022-02-20 18:50:42,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:42,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:42,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 250 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 394 states. [2022-02-20 18:50:42,512 INFO L87 Difference]: Start difference. First operand has 251 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 250 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 394 states. [2022-02-20 18:50:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:42,522 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2022-02-20 18:50:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 575 transitions. [2022-02-20 18:50:42,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:42,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:42,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:42,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 249 states have (on average 1.4698795180722892) internal successors, (366), 250 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 366 transitions. [2022-02-20 18:50:42,530 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 366 transitions. Word has length 49 [2022-02-20 18:50:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:42,530 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 366 transitions. [2022-02-20 18:50:42,530 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:50:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 366 transitions. [2022-02-20 18:50:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:42,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:42,531 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:42,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:50:42,531 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:42,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 727047131, now seen corresponding path program 1 times [2022-02-20 18:50:42,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:42,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67455245] [2022-02-20 18:50:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:42,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {4221#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {4221#true} is VALID [2022-02-20 18:50:42,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {4221#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {4221#true} is VALID [2022-02-20 18:50:42,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {4221#true} assume 0 == ~r1~0 % 256; {4221#true} is VALID [2022-02-20 18:50:42,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {4221#true} assume ~id1~0 >= 0; {4221#true} is VALID [2022-02-20 18:50:42,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {4221#true} assume 0 == ~st1~0; {4223#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:42,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {4223#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {4223#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:42,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {4223#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {4223#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:42,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {4223#(<= ~st1~0 0)} assume ~id2~0 >= 0; {4223#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:42,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {4223#(<= ~st1~0 0)} assume 0 == ~st2~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {4224#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 % 256 >= 3); {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256); {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~1#1 != ~nomsg~0); {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~1#1 != ~nomsg~0); {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 != ~nomsg~0; {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~1#1 > ~id3~0); {4224#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:42,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {4224#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {4225#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:42,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {4225#(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; {4225#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:42,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {4225#(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_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~0; {4222#false} is VALID [2022-02-20 18:50:42,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {4222#false} 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; {4222#false} is VALID [2022-02-20 18:50:42,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {4222#false} assume 0 == main_~assert__arg~2#1 % 256; {4222#false} is VALID [2022-02-20 18:50:42,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {4222#false} assume !false; {4222#false} is VALID [2022-02-20 18:50:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:42,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:42,605 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67455245] [2022-02-20 18:50:42,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67455245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:42,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:42,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:42,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285049666] [2022-02-20 18:50:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:42,606 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:50:42,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:42,606 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:50:42,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:42,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:42,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:42,641 INFO L87 Difference]: Start difference. First operand 251 states and 366 transitions. 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:50:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:43,230 INFO L93 Difference]: Finished difference Result 566 states and 842 transitions. [2022-02-20 18:50:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:43,231 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:50:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:43,231 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:50:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 18:50:43,234 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:50:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 18:50:43,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-02-20 18:50:43,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:43,517 INFO L225 Difference]: With dead ends: 566 [2022-02-20 18:50:43,517 INFO L226 Difference]: Without dead ends: 482 [2022-02-20 18:50:43,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:43,518 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 358 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:43,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 564 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-02-20 18:50:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 382. [2022-02-20 18:50:43,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:43,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 482 states. Second operand has 382 states, 380 states have (on average 1.4894736842105263) internal successors, (566), 381 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,707 INFO L74 IsIncluded]: Start isIncluded. First operand 482 states. Second operand has 382 states, 380 states have (on average 1.4894736842105263) internal successors, (566), 381 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,708 INFO L87 Difference]: Start difference. First operand 482 states. Second operand has 382 states, 380 states have (on average 1.4894736842105263) internal successors, (566), 381 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:43,718 INFO L93 Difference]: Finished difference Result 482 states and 710 transitions. [2022-02-20 18:50:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 710 transitions. [2022-02-20 18:50:43,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:43,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:43,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 380 states have (on average 1.4894736842105263) internal successors, (566), 381 states have internal predecessors, (566), 0 states have call successors, (0), 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 482 states. [2022-02-20 18:50:43,720 INFO L87 Difference]: Start difference. First operand has 382 states, 380 states have (on average 1.4894736842105263) internal successors, (566), 381 states have internal predecessors, (566), 0 states have call successors, (0), 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 482 states. [2022-02-20 18:50:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:43,730 INFO L93 Difference]: Finished difference Result 482 states and 710 transitions. [2022-02-20 18:50:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 710 transitions. [2022-02-20 18:50:43,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:43,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:43,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:43,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 380 states have (on average 1.4894736842105263) internal successors, (566), 381 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 566 transitions. [2022-02-20 18:50:43,739 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 566 transitions. Word has length 49 [2022-02-20 18:50:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:43,740 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 566 transitions. [2022-02-20 18:50:43,740 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:50:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 566 transitions. [2022-02-20 18:50:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 18:50:43,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:43,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:43,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:50:43,741 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:43,741 INFO L85 PathProgramCache]: Analyzing trace with hash 118541383, now seen corresponding path program 1 times [2022-02-20 18:50:43,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:43,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192331335] [2022-02-20 18:50:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:43,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {6476#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {6476#true} is VALID [2022-02-20 18:50:43,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {6476#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {6476#true} is VALID [2022-02-20 18:50:43,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {6476#true} assume 0 == ~r1~0 % 256; {6476#true} is VALID [2022-02-20 18:50:43,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {6476#true} assume ~id1~0 >= 0; {6476#true} is VALID [2022-02-20 18:50:43,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {6476#true} assume 0 == ~st1~0; {6476#true} is VALID [2022-02-20 18:50:43,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {6476#true} assume ~send1~0 == ~id1~0; {6476#true} is VALID [2022-02-20 18:50:43,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {6476#true} assume 0 == ~mode1~0 % 256; {6476#true} is VALID [2022-02-20 18:50:43,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {6476#true} assume ~id2~0 >= 0; {6476#true} is VALID [2022-02-20 18:50:43,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {6476#true} assume 0 == ~st2~0; {6478#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:43,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {6478#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {6478#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:43,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {6478#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {6478#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:43,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {6478#(<= ~st2~0 0)} assume ~id3~0 >= 0; {6478#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:43,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {6478#(<= ~st2~0 0)} assume 0 == ~st3~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {6479#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 % 256 >= 3); {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256); {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 != ~nomsg~0; {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~1#1 > ~id1~0); {6479#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:43,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {6479#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~1#1 == ~id1~0;~st1~0 := 1; {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {6480#(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; {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {6480#(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; {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {6480#(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; {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {6480#(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; {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {6480#(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; {6480#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:43,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {6480#(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_1696~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1696~0; {6477#false} is VALID [2022-02-20 18:50:43,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {6477#false} 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; {6477#false} is VALID [2022-02-20 18:50:43,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {6477#false} assume 0 == main_~assert__arg~2#1 % 256; {6477#false} is VALID [2022-02-20 18:50:43,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {6477#false} assume !false; {6477#false} is VALID [2022-02-20 18:50:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:43,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:43,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192331335] [2022-02-20 18:50:43,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192331335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:43,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:43,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:43,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587340830] [2022-02-20 18:50:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:43,838 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:50:43,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:43,838 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:50:43,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:43,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:43,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:43,877 INFO L87 Difference]: Start difference. First operand 382 states and 566 transitions. 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:50:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:44,547 INFO L93 Difference]: Finished difference Result 659 states and 985 transitions. [2022-02-20 18:50:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:44,548 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:50:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:44,548 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:50:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 18:50:44,550 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:50:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-02-20 18:50:44,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-02-20 18:50:44,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:44,863 INFO L225 Difference]: With dead ends: 659 [2022-02-20 18:50:44,864 INFO L226 Difference]: Without dead ends: 575 [2022-02-20 18:50:44,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:44,866 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 361 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:44,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 581 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-02-20 18:50:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 475. [2022-02-20 18:50:45,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:45,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 575 states. Second operand has 475 states, 473 states have (on average 1.4989429175475688) internal successors, (709), 474 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,143 INFO L74 IsIncluded]: Start isIncluded. First operand 575 states. Second operand has 475 states, 473 states have (on average 1.4989429175475688) internal successors, (709), 474 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,144 INFO L87 Difference]: Start difference. First operand 575 states. Second operand has 475 states, 473 states have (on average 1.4989429175475688) internal successors, (709), 474 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,161 INFO L93 Difference]: Finished difference Result 575 states and 853 transitions. [2022-02-20 18:50:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 853 transitions. [2022-02-20 18:50:45,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 475 states, 473 states have (on average 1.4989429175475688) internal successors, (709), 474 states have internal predecessors, (709), 0 states have call successors, (0), 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 575 states. [2022-02-20 18:50:45,164 INFO L87 Difference]: Start difference. First operand has 475 states, 473 states have (on average 1.4989429175475688) internal successors, (709), 474 states have internal predecessors, (709), 0 states have call successors, (0), 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 575 states. [2022-02-20 18:50:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:45,180 INFO L93 Difference]: Finished difference Result 575 states and 853 transitions. [2022-02-20 18:50:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 853 transitions. [2022-02-20 18:50:45,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:45,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:45,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:45,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 473 states have (on average 1.4989429175475688) internal successors, (709), 474 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 709 transitions. [2022-02-20 18:50:45,197 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 709 transitions. Word has length 49 [2022-02-20 18:50:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:45,197 INFO L470 AbstractCegarLoop]: Abstraction has 475 states and 709 transitions. [2022-02-20 18:50:45,198 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:50:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 709 transitions. [2022-02-20 18:50:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 18:50:45,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:45,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:45,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:50:45,200 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2078764873, now seen corresponding path program 1 times [2022-02-20 18:50:45,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:45,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606412973] [2022-02-20 18:50:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:45,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:45,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {9175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {9177#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:45,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {9177#(<= (+ ~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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {9177#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:45,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {9177#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {9177#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:45,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {9177#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {9178#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:45,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {9178#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {9178#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:50:45,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {9178#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {9179#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {9179#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:50:45,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {9179#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(~send1~0 != ~nomsg~0);main_~node1____CPAchecker_TMP_0~0#1 := ~p1_new~0; {9176#false} is VALID [2022-02-20 18:50:45,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {9176#false} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {9176#false} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {9176#false} is VALID [2022-02-20 18:50:45,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {9176#false} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {9176#false} is VALID [2022-02-20 18:50:45,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {9176#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {9176#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {9176#false} is VALID [2022-02-20 18:50:45,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {9176#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {9176#false} is VALID [2022-02-20 18:50:45,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {9176#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {9176#false} is VALID [2022-02-20 18:50:45,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {9176#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9176#false} is VALID [2022-02-20 18:50:45,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {9176#false} assume !(~r1~0 % 256 >= 3); {9176#false} is VALID [2022-02-20 18:50:45,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {9176#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {9176#false} is VALID [2022-02-20 18:50:45,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {9176#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {9176#false} is VALID [2022-02-20 18:50:45,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {9176#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {9176#false} assume !(0 == ~mode1~0 % 256); {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {9176#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {9176#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {9176#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {9176#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {9176#false} assume main_~node2__m2~1#1 != ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {9176#false} assume !(main_~node2__m2~1#1 > ~id2~0); {9176#false} is VALID [2022-02-20 18:50:45,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {9176#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {9176#false} is VALID [2022-02-20 18:50:45,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {9176#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {9176#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {9176#false} is VALID [2022-02-20 18:50:45,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {9176#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {9176#false} is VALID [2022-02-20 18:50:45,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {9176#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; {9176#false} is VALID [2022-02-20 18:50:45,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {9176#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {9176#false} is VALID [2022-02-20 18:50:45,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {9176#false} assume !(~r1~0 % 256 >= 3); {9176#false} is VALID [2022-02-20 18:50:45,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {9176#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {9176#false} is VALID [2022-02-20 18:50:45,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {9176#false} assume 0 == main_~assert__arg~3#1 % 256; {9176#false} is VALID [2022-02-20 18:50:45,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {9176#false} assume !false; {9176#false} is VALID [2022-02-20 18:50:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:45,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:45,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606412973] [2022-02-20 18:50:45,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606412973] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:45,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:45,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:45,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79429724] [2022-02-20 18:50:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:45,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:45,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:45,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:45,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:45,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:45,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:45,349 INFO L87 Difference]: Start difference. First operand 475 states and 709 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:46,514 INFO L93 Difference]: Finished difference Result 1341 states and 2026 transitions. [2022-02-20 18:50:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:46,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-02-20 18:50:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:46,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 350 transitions. [2022-02-20 18:50:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 350 transitions. [2022-02-20 18:50:46,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 350 transitions. [2022-02-20 18:50:46,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:46,767 INFO L225 Difference]: With dead ends: 1341 [2022-02-20 18:50:46,767 INFO L226 Difference]: Without dead ends: 888 [2022-02-20 18:50:46,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:46,771 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 560 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:46,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 137 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:50:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-02-20 18:50:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 883. [2022-02-20 18:50:47,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:47,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 888 states. Second operand has 883 states, 881 states have (on average 1.5062429057888762) internal successors, (1327), 882 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,538 INFO L74 IsIncluded]: Start isIncluded. First operand 888 states. Second operand has 883 states, 881 states have (on average 1.5062429057888762) internal successors, (1327), 882 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,539 INFO L87 Difference]: Start difference. First operand 888 states. Second operand has 883 states, 881 states have (on average 1.5062429057888762) internal successors, (1327), 882 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,563 INFO L93 Difference]: Finished difference Result 888 states and 1330 transitions. [2022-02-20 18:50:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1330 transitions. [2022-02-20 18:50:47,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 881 states have (on average 1.5062429057888762) internal successors, (1327), 882 states have internal predecessors, (1327), 0 states have call successors, (0), 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 888 states. [2022-02-20 18:50:47,567 INFO L87 Difference]: Start difference. First operand has 883 states, 881 states have (on average 1.5062429057888762) internal successors, (1327), 882 states have internal predecessors, (1327), 0 states have call successors, (0), 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 888 states. [2022-02-20 18:50:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:47,606 INFO L93 Difference]: Finished difference Result 888 states and 1330 transitions. [2022-02-20 18:50:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1330 transitions. [2022-02-20 18:50:47,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:47,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:47,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:47,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.5062429057888762) internal successors, (1327), 882 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1327 transitions. [2022-02-20 18:50:47,651 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1327 transitions. Word has length 50 [2022-02-20 18:50:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:47,652 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1327 transitions. [2022-02-20 18:50:47,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1327 transitions. [2022-02-20 18:50:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 18:50:47,652 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:47,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:47,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:50:47,653 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:47,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1832903282, now seen corresponding path program 1 times [2022-02-20 18:50:47,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:47,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042456595] [2022-02-20 18:50:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:47,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {14007#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {14009#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {14009#(<= (+ ~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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {14009#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {14009#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {14009#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {14009#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {14009#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {14009#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {14009#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {14009#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {14009#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {14009#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {14009#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:47,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {14009#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {14010#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {14010#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {14010#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {14010#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {14011#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {14011#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {14011#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0);main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {14008#false} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {14008#false} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {14008#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {14008#false} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {14008#false} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {14008#false} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {14008#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {14008#false} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {14008#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14008#false} is VALID [2022-02-20 18:50:47,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {14008#false} assume !(~r1~0 % 256 >= 3); {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {14008#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {14008#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {14008#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {14008#false} assume !(0 == ~mode1~0 % 256); {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {14008#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {14008#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {14008#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {14008#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {14008#false} assume main_~node2__m2~1#1 != ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {14008#false} assume !(main_~node2__m2~1#1 > ~id2~0); {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {14008#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {14008#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {14008#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 44: Hoare triple {14008#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 45: Hoare triple {14008#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; {14008#false} is VALID [2022-02-20 18:50:47,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {14008#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {14008#false} is VALID [2022-02-20 18:50:47,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {14008#false} assume !(~r1~0 % 256 >= 3); {14008#false} is VALID [2022-02-20 18:50:47,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {14008#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {14008#false} is VALID [2022-02-20 18:50:47,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {14008#false} assume 0 == main_~assert__arg~3#1 % 256; {14008#false} is VALID [2022-02-20 18:50:47,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {14008#false} assume !false; {14008#false} is VALID [2022-02-20 18:50:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:47,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:47,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042456595] [2022-02-20 18:50:47,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042456595] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:47,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:47,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:47,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477187397] [2022-02-20 18:50:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:47,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:47,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:47,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:47,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:47,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:47,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:47,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:47,752 INFO L87 Difference]: Start difference. First operand 883 states and 1327 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:49,108 INFO L93 Difference]: Finished difference Result 1740 states and 2627 transitions. [2022-02-20 18:50:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:49,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-20 18:50:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2022-02-20 18:50:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2022-02-20 18:50:49,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 251 transitions. [2022-02-20 18:50:49,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:49,292 INFO L225 Difference]: With dead ends: 1740 [2022-02-20 18:50:49,292 INFO L226 Difference]: Without dead ends: 883 [2022-02-20 18:50:49,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:49,294 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 365 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:49,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 90 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-02-20 18:50:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2022-02-20 18:50:50,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:50,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 883 states. Second operand has 883 states, 881 states have (on average 1.4846765039727583) internal successors, (1308), 882 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,022 INFO L74 IsIncluded]: Start isIncluded. First operand 883 states. Second operand has 883 states, 881 states have (on average 1.4846765039727583) internal successors, (1308), 882 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,023 INFO L87 Difference]: Start difference. First operand 883 states. Second operand has 883 states, 881 states have (on average 1.4846765039727583) internal successors, (1308), 882 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,049 INFO L93 Difference]: Finished difference Result 883 states and 1308 transitions. [2022-02-20 18:50:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1308 transitions. [2022-02-20 18:50:50,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 881 states have (on average 1.4846765039727583) internal successors, (1308), 882 states have internal predecessors, (1308), 0 states have call successors, (0), 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 883 states. [2022-02-20 18:50:50,052 INFO L87 Difference]: Start difference. First operand has 883 states, 881 states have (on average 1.4846765039727583) internal successors, (1308), 882 states have internal predecessors, (1308), 0 states have call successors, (0), 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 883 states. [2022-02-20 18:50:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:50,076 INFO L93 Difference]: Finished difference Result 883 states and 1308 transitions. [2022-02-20 18:50:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1308 transitions. [2022-02-20 18:50:50,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:50,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:50,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:50,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.4846765039727583) internal successors, (1308), 882 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1308 transitions. [2022-02-20 18:50:50,109 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1308 transitions. Word has length 51 [2022-02-20 18:50:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:50,110 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1308 transitions. [2022-02-20 18:50:50,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1308 transitions. [2022-02-20 18:50:50,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:50:50,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:50,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:50,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:50,111 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1624812893, now seen corresponding path program 1 times [2022-02-20 18:50:50,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:50,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943401034] [2022-02-20 18:50:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:50,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:50,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {19387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {19389#(<= (+ ~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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0 % 256; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st2~0; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume ~send2~0 == ~id2~0; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode2~0 % 256; {19389#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:50,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {19389#(<= (+ ~nomsg~0 1) 0)} assume ~id3~0 >= 0; {19390#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:50,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {19390#(<= (+ ~nomsg~0 1) ~id3~0)} assume 0 == ~st3~0; {19390#(<= (+ ~nomsg~0 1) ~id3~0)} is VALID [2022-02-20 18:50:50,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {19390#(<= (+ ~nomsg~0 1) ~id3~0)} assume ~send3~0 == ~id3~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume 0 == ~mode3~0 % 256; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id2~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id1~0 != ~id3~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {19391#(<= (+ ~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;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send1~0 != ~nomsg~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~send2~0 != ~nomsg~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19391#(<= (+ ~nomsg~0 1) ~send3~0)} is VALID [2022-02-20 18:50:50,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {19391#(<= (+ ~nomsg~0 1) ~send3~0)} assume !(~send3~0 != ~nomsg~0);main_~node3____CPAchecker_TMP_0~0#1 := ~p3_new~0; {19388#false} is VALID [2022-02-20 18:50:50,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {19388#false} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {19388#false} is VALID [2022-02-20 18:50:50,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {19388#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19388#false} is VALID [2022-02-20 18:50:50,191 INFO L290 TraceCheckUtils]: 31: Hoare triple {19388#false} assume !(~r1~0 % 256 >= 3); {19388#false} is VALID [2022-02-20 18:50:50,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {19388#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {19388#false} is VALID [2022-02-20 18:50:50,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {19388#false} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {19388#false} is VALID [2022-02-20 18:50:50,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {19388#false} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {19388#false} is VALID [2022-02-20 18:50:50,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {19388#false} assume !(0 == ~mode1~0 % 256); {19388#false} is VALID [2022-02-20 18:50:50,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {19388#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19388#false} is VALID [2022-02-20 18:50:50,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {19388#false} assume !(main_~node1__m1~1#1 != ~nomsg~0); {19388#false} is VALID [2022-02-20 18:50:50,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {19388#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {19388#false} is VALID [2022-02-20 18:50:50,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {19388#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {19388#false} is VALID [2022-02-20 18:50:50,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {19388#false} assume main_~node2__m2~1#1 != ~nomsg~0; {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {19388#false} assume !(main_~node2__m2~1#1 > ~id2~0); {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {19388#false} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {19388#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {19388#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {19388#false} assume !(main_~node3__m3~1#1 != ~nomsg~0); {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {19388#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; {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {19388#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19388#false} is VALID [2022-02-20 18:50:50,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {19388#false} assume !(~r1~0 % 256 >= 3); {19388#false} is VALID [2022-02-20 18:50:50,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {19388#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {19388#false} is VALID [2022-02-20 18:50:50,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {19388#false} assume 0 == main_~assert__arg~3#1 % 256; {19388#false} is VALID [2022-02-20 18:50:50,200 INFO L290 TraceCheckUtils]: 51: Hoare triple {19388#false} assume !false; {19388#false} is VALID [2022-02-20 18:50:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:50,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:50,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943401034] [2022-02-20 18:50:50,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943401034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:50,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:50,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:50:50,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344061661] [2022-02-20 18:50:50,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:50,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:50:50,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:50,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:50,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:50,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:50,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:50,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:50,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:50,225 INFO L87 Difference]: Start difference. First operand 883 states and 1308 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:51,963 INFO L93 Difference]: Finished difference Result 1736 states and 2585 transitions. [2022-02-20 18:50:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-02-20 18:50:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2022-02-20 18:50:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2022-02-20 18:50:51,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 243 transitions. [2022-02-20 18:50:52,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:52,161 INFO L225 Difference]: With dead ends: 1736 [2022-02-20 18:50:52,161 INFO L226 Difference]: Without dead ends: 883 [2022-02-20 18:50:52,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:50:52,162 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 347 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:52,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 98 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-02-20 18:50:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2022-02-20 18:50:53,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:53,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 883 states. Second operand has 883 states, 881 states have (on average 1.4631101021566402) internal successors, (1289), 882 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,718 INFO L74 IsIncluded]: Start isIncluded. First operand 883 states. Second operand has 883 states, 881 states have (on average 1.4631101021566402) internal successors, (1289), 882 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,719 INFO L87 Difference]: Start difference. First operand 883 states. Second operand has 883 states, 881 states have (on average 1.4631101021566402) internal successors, (1289), 882 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,743 INFO L93 Difference]: Finished difference Result 883 states and 1289 transitions. [2022-02-20 18:50:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1289 transitions. [2022-02-20 18:50:53,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 881 states have (on average 1.4631101021566402) internal successors, (1289), 882 states have internal predecessors, (1289), 0 states have call successors, (0), 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 883 states. [2022-02-20 18:50:53,747 INFO L87 Difference]: Start difference. First operand has 883 states, 881 states have (on average 1.4631101021566402) internal successors, (1289), 882 states have internal predecessors, (1289), 0 states have call successors, (0), 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 883 states. [2022-02-20 18:50:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:53,771 INFO L93 Difference]: Finished difference Result 883 states and 1289 transitions. [2022-02-20 18:50:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1289 transitions. [2022-02-20 18:50:53,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:53,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:53,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:53,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.4631101021566402) internal successors, (1289), 882 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1289 transitions. [2022-02-20 18:50:53,803 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1289 transitions. Word has length 52 [2022-02-20 18:50:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:53,803 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1289 transitions. [2022-02-20 18:50:53,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1289 transitions. [2022-02-20 18:50:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:50:53,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:53,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:50:53,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:53,805 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1423750650, now seen corresponding path program 1 times [2022-02-20 18:50:53,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:53,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807592927] [2022-02-20 18:50:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:54,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {24762#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {24764#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:50:54,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {24764#(<= (+ ~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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~r1~0 % 256; {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id1~0 >= 0; {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~st1~0; {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~send1~0 == ~id1~0; {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume 0 == ~mode1~0 % 256; {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {24765#(and (<= (+ ~nomsg~0 1) 0) (<= ~id2~0 127))} assume ~id2~0 >= 0; {24766#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {24766#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume 0 == ~st2~0; {24766#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} is VALID [2022-02-20 18:50:54,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {24766#(and (<= (+ ~nomsg~0 1) 0) (<= 0 ~id2~0) (<= ~id2~0 127))} assume ~send2~0 == ~id2~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode2~0 % 256; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id3~0 >= 0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~st3~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send3~0 == ~id3~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 == ~mode3~0 % 256; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id2~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id1~0 != ~id3~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send1~0 != ~nomsg~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~send2~0 != ~nomsg~0; {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} is VALID [2022-02-20 18:50:54,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {24767#(and (<= 0 ~send2~0) (<= ~send2~0 127) (<= (+ ~nomsg~0 1) 0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {24768#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:50:54,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {24768#(and (<= |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127) (<= (+ ~nomsg~0 1) 0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24769#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:54,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {24769#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24769#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:54,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {24769#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~send3~0 != ~nomsg~0; {24769#(<= (+ ~nomsg~0 1) ~p2_new~0)} is VALID [2022-02-20 18:50:54,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {24769#(<= (+ ~nomsg~0 1) ~p2_new~0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {24770#(or (and (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256))) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256)) (- 256)) ~p2_new~0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 1) |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} is VALID [2022-02-20 18:50:54,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {24770#(or (and (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256))) ~p2_new~0)) (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (or (not (= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) (- 256)) (- 256)) ~p2_new~0)) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127)))) (and (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 256 (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)) (or (not (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))) (and (<= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 1) |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) 127))))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:54,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:54,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(~r1~0 % 256 >= 3); {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:54,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:54,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:54,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:54,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(0 == ~mode1~0 % 256); {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} is VALID [2022-02-20 18:50:54,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {24771#(or (not (= ~p3_old~0 ~p2_old~0)) (not (= ~p3_old~0 ~nomsg~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24772#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} is VALID [2022-02-20 18:50:54,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {24772#(or (not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|)) (not (= |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0)))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {24773#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {24773#(not (= ~nomsg~0 ~p2_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {24773#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {24773#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {24773#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {24773#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {24773#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {24773#(not (= ~nomsg~0 ~p2_old~0))} assume !(main_~node2__m2~1#1 > ~id2~0); {24773#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {24773#(not (= ~nomsg~0 ~p2_old~0))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {24773#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {24773#(not (= ~nomsg~0 ~p2_old~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {24773#(not (= ~nomsg~0 ~p2_old~0))} is VALID [2022-02-20 18:50:54,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {24773#(not (= ~nomsg~0 ~p2_old~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24774#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} is VALID [2022-02-20 18:50:54,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {24774#(not (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~1#1|))} assume !(main_~node3__m3~1#1 != ~nomsg~0); {24763#false} is VALID [2022-02-20 18:50:54,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {24763#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; {24763#false} is VALID [2022-02-20 18:50:54,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {24763#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {24763#false} is VALID [2022-02-20 18:50:54,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {24763#false} assume !(~r1~0 % 256 >= 3); {24763#false} is VALID [2022-02-20 18:50:54,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {24763#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {24763#false} is VALID [2022-02-20 18:50:54,041 INFO L290 TraceCheckUtils]: 51: Hoare triple {24763#false} assume 0 == main_~assert__arg~3#1 % 256; {24763#false} is VALID [2022-02-20 18:50:54,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {24763#false} assume !false; {24763#false} is VALID [2022-02-20 18:50:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:54,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:54,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807592927] [2022-02-20 18:50:54,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807592927] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:54,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:54,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 18:50:54,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147032172] [2022-02-20 18:50:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:54,042 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 18:50:54,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:54,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:54,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:54,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:50:54,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:50:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:50:54,084 INFO L87 Difference]: Start difference. First operand 883 states and 1289 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 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:51:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:00,101 INFO L93 Difference]: Finished difference Result 2492 states and 3651 transitions. [2022-02-20 18:51:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 18:51:00,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 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:51:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 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:51:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 295 transitions. [2022-02-20 18:51:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 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:51:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 295 transitions. [2022-02-20 18:51:00,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 295 transitions. [2022-02-20 18:51:00,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:00,457 INFO L225 Difference]: With dead ends: 2492 [2022-02-20 18:51:00,458 INFO L226 Difference]: Without dead ends: 1713 [2022-02-20 18:51:00,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:51:00,459 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 783 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:00,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 380 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:51:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2022-02-20 18:51:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 883. [2022-02-20 18:51:02,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:02,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1713 states. Second operand has 883 states, 881 states have (on average 1.456299659477866) internal successors, (1283), 882 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,749 INFO L74 IsIncluded]: Start isIncluded. First operand 1713 states. Second operand has 883 states, 881 states have (on average 1.456299659477866) internal successors, (1283), 882 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,750 INFO L87 Difference]: Start difference. First operand 1713 states. Second operand has 883 states, 881 states have (on average 1.456299659477866) internal successors, (1283), 882 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,859 INFO L93 Difference]: Finished difference Result 1713 states and 2491 transitions. [2022-02-20 18:51:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2491 transitions. [2022-02-20 18:51:02,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:02,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:02,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 881 states have (on average 1.456299659477866) internal successors, (1283), 882 states have internal predecessors, (1283), 0 states have call successors, (0), 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 1713 states. [2022-02-20 18:51:02,863 INFO L87 Difference]: Start difference. First operand has 883 states, 881 states have (on average 1.456299659477866) internal successors, (1283), 882 states have internal predecessors, (1283), 0 states have call successors, (0), 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 1713 states. [2022-02-20 18:51:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:02,950 INFO L93 Difference]: Finished difference Result 1713 states and 2491 transitions. [2022-02-20 18:51:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2491 transitions. [2022-02-20 18:51:02,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:02,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:02,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:02,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.456299659477866) internal successors, (1283), 882 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1283 transitions. [2022-02-20 18:51:02,991 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1283 transitions. Word has length 53 [2022-02-20 18:51:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:02,991 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1283 transitions. [2022-02-20 18:51:02,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 12 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:51:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1283 transitions. [2022-02-20 18:51:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 18:51:02,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:02,992 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:51:02,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:51:02,992 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash 232050318, now seen corresponding path program 1 times [2022-02-20 18:51:02,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:02,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425351473] [2022-02-20 18:51:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:03,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {32919#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {32921#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:51:03,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {32921#(<= (+ ~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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~r1~0 % 256; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id1~0 >= 0; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st1~0; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode1~0 % 256; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id2~0 >= 0; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st2~0; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send2~0 == ~id2~0; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~mode2~0 % 256; {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {32922#(and (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~id3~0 >= 0; {32923#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {32923#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume 0 == ~st3~0; {32923#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:03,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {32923#(and (<= 0 ~id3~0) (<= (+ ~nomsg~0 1) 0) (<= ~id3~0 127))} assume ~send3~0 == ~id3~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:03,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {32924#(and (<= ~send3~0 127) (<= (+ ~nomsg~0 1) 0) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {32925#(and (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))} is VALID [2022-02-20 18:51:03,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {32925#(and (<= 0 |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1|) (<= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 127) (not (= (+ ~nomsg~0 (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) (* |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| (- 1))) 0)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {32926#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:03,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {32926#(not (= ~p3_old~0 ~nomsg~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32926#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:03,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {32926#(not (= ~p3_old~0 ~nomsg~0))} assume !(~r1~0 % 256 >= 3); {32926#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:03,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {32926#(not (= ~p3_old~0 ~nomsg~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {32926#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:03,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {32926#(not (= ~p3_old~0 ~nomsg~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {32926#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:03,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {32926#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {32926#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:03,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {32926#(not (= ~p3_old~0 ~nomsg~0))} assume !(0 == ~mode1~0 % 256); {32926#(not (= ~p3_old~0 ~nomsg~0))} is VALID [2022-02-20 18:51:03,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {32926#(not (= ~p3_old~0 ~nomsg~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {32927#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {32927#(not (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~1#1|))} assume !(main_~node1__m1~1#1 != ~nomsg~0); {32920#false} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {32920#false} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {32920#false} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {32920#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {32920#false} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {32920#false} assume !(main_~node2__m2~1#1 != ~nomsg~0); {32920#false} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {32920#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {32920#false} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {32920#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {32920#false} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {32920#false} assume main_~node3__m3~1#1 != ~nomsg~0; {32920#false} is VALID [2022-02-20 18:51:03,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {32920#false} assume !(main_~node3__m3~1#1 > ~id3~0); {32920#false} is VALID [2022-02-20 18:51:03,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {32920#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {32920#false} is VALID [2022-02-20 18:51:03,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {32920#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; {32920#false} is VALID [2022-02-20 18:51:03,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {32920#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {32920#false} is VALID [2022-02-20 18:51:03,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {32920#false} assume !(~r1~0 % 256 >= 3); {32920#false} is VALID [2022-02-20 18:51:03,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {32920#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {32920#false} is VALID [2022-02-20 18:51:03,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {32920#false} assume 0 == main_~assert__arg~3#1 % 256; {32920#false} is VALID [2022-02-20 18:51:03,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {32920#false} assume !false; {32920#false} is VALID [2022-02-20 18:51:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:03,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:03,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425351473] [2022-02-20 18:51:03,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425351473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:03,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:03,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:51:03,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660784302] [2022-02-20 18:51:03,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:03,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:51:03,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:03,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:51:03,178 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:51:03,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 18:51:03,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 18:51:03,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:51:03,179 INFO L87 Difference]: Start difference. First operand 883 states and 1283 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:51:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:09,353 INFO L93 Difference]: Finished difference Result 2444 states and 3594 transitions. [2022-02-20 18:51:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:51:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:51:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:51:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 299 transitions. [2022-02-20 18:51:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:51:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 299 transitions. [2022-02-20 18:51:09,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 299 transitions. [2022-02-20 18:51:09,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:09,683 INFO L225 Difference]: With dead ends: 2444 [2022-02-20 18:51:09,684 INFO L226 Difference]: Without dead ends: 1662 [2022-02-20 18:51:09,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:51:09,685 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 480 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:09,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 297 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:51:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2022-02-20 18:51:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 883. [2022-02-20 18:51:12,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:12,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1662 states. Second operand has 883 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 882 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,138 INFO L74 IsIncluded]: Start isIncluded. First operand 1662 states. Second operand has 883 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 882 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,138 INFO L87 Difference]: Start difference. First operand 1662 states. Second operand has 883 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 882 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,218 INFO L93 Difference]: Finished difference Result 1662 states and 2433 transitions. [2022-02-20 18:51:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2433 transitions. [2022-02-20 18:51:12,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:12,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:12,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 882 states have internal predecessors, (1282), 0 states have call successors, (0), 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 1662 states. [2022-02-20 18:51:12,238 INFO L87 Difference]: Start difference. First operand has 883 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 882 states have internal predecessors, (1282), 0 states have call successors, (0), 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 1662 states. [2022-02-20 18:51:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:12,318 INFO L93 Difference]: Finished difference Result 1662 states and 2433 transitions. [2022-02-20 18:51:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2433 transitions. [2022-02-20 18:51:12,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:12,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:12,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:12,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.4551645856980704) internal successors, (1282), 882 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1282 transitions. [2022-02-20 18:51:12,351 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1282 transitions. Word has length 53 [2022-02-20 18:51:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:12,351 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1282 transitions. [2022-02-20 18:51:12,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 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:51:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1282 transitions. [2022-02-20 18:51:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 18:51:12,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:12,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:12,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:51:12,352 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:12,353 INFO L85 PathProgramCache]: Analyzing trace with hash 563944451, now seen corresponding path program 1 times [2022-02-20 18:51:12,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:12,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472234277] [2022-02-20 18:51:12,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:12,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {40876#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {40878#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} is VALID [2022-02-20 18:51:12,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {40878#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {40879#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {40879#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume 0 == ~r1~0 % 256; {40879#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {40879#(and (<= (+ ~nomsg~0 1) 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume ~id1~0 >= 0; {40880#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {40880#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume 0 == ~st1~0; {40880#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {40880#(and (<= (+ ~nomsg~0 1) ~id1~0) (<= 0 (+ ~nomsg~0 1)) (<= ~id1~0 (+ ~nomsg~0 128)))} assume ~send1~0 == ~id1~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode1~0 % 256; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 >= 0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st2~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send2~0 == ~id2~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode2~0 % 256; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id3~0 >= 0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~st3~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send3~0 == ~id3~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 == ~mode3~0 % 256; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id2~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id1~0 != ~id3~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~send1~0 != ~nomsg~0; {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} is VALID [2022-02-20 18:51:12,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {40881#(and (<= ~send1~0 (+ ~nomsg~0 ~id1~0 1)) (<= (+ ~nomsg~0 1) ~send1~0) (<= ~send1~0 (+ ~nomsg~0 128)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {40882#(or (and (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 256 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (and (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ ~nomsg~0 ~id1~0 1)) (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0) (<= (+ ~nomsg~0 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)))} is VALID [2022-02-20 18:51:12,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {40882#(or (and (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (not (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (or (not (= (+ (* (- 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) ~nomsg~0 256 (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256))) 0)) (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ (* 256 (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256)) 127)))) (and (<= |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| (+ ~nomsg~0 ~id1~0 1)) (<= (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 0) (<= (+ ~nomsg~0 1) |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~send2~0 != ~nomsg~0; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~send3~0 != ~nomsg~0; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} is VALID [2022-02-20 18:51:12,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {40883#(or (not (= ~nomsg~0 ~p1_new~0)) (<= 255 ~id1~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:12,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:12,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(~r1~0 % 256 >= 3); {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:12,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:12,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:12,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:12,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(0 == ~mode1~0 % 256); {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} is VALID [2022-02-20 18:51:12,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {40884#(or (not (= ~nomsg~0 ~p1_old~0)) (<= (+ ~p3_old~0 1) ~id1~0))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {40885#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:51:12,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {40885#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 != ~nomsg~0; {40885#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} is VALID [2022-02-20 18:51:12,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {40885#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (not (= ~nomsg~0 ~p1_old~0)))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {40886#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:12,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {40886#(not (= ~nomsg~0 ~p1_old~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {40886#(not (= ~nomsg~0 ~p1_old~0))} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {40886#(not (= ~nomsg~0 ~p1_old~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {40887#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {40887#(not (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~1#1|))} assume !(main_~node2__m2~1#1 != ~nomsg~0); {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {40877#false} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {40877#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {40877#false} assume main_~node3__m3~1#1 != ~nomsg~0; {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {40877#false} assume !(main_~node3__m3~1#1 > ~id3~0); {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {40877#false} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {40877#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; {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {40877#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {40877#false} assume !(~r1~0 % 256 >= 3); {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {40877#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {40877#false} is VALID [2022-02-20 18:51:12,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {40877#false} assume 0 == main_~assert__arg~3#1 % 256; {40877#false} is VALID [2022-02-20 18:51:12,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {40877#false} assume !false; {40877#false} is VALID [2022-02-20 18:51:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:12,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:12,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472234277] [2022-02-20 18:51:12,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472234277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:12,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:12,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 18:51:12,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321092624] [2022-02-20 18:51:12,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:12,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:12,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:12,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:12,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:12,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:51:12,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:12,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:51:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:51:12,628 INFO L87 Difference]: Start difference. First operand 883 states and 1282 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:19,956 INFO L93 Difference]: Finished difference Result 2257 states and 3269 transitions. [2022-02-20 18:51:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 18:51:19,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 18:51:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 355 transitions. [2022-02-20 18:51:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 355 transitions. [2022-02-20 18:51:19,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 355 transitions. [2022-02-20 18:51:20,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:20,284 INFO L225 Difference]: With dead ends: 2257 [2022-02-20 18:51:20,285 INFO L226 Difference]: Without dead ends: 1463 [2022-02-20 18:51:20,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:51:20,288 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 804 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:20,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 596 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 18:51:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-02-20 18:51:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 883. [2022-02-20 18:51:23,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:23,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1463 states. Second operand has 883 states, 881 states have (on average 1.4517593643586832) internal successors, (1279), 882 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,861 INFO L74 IsIncluded]: Start isIncluded. First operand 1463 states. Second operand has 883 states, 881 states have (on average 1.4517593643586832) internal successors, (1279), 882 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,862 INFO L87 Difference]: Start difference. First operand 1463 states. Second operand has 883 states, 881 states have (on average 1.4517593643586832) internal successors, (1279), 882 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,920 INFO L93 Difference]: Finished difference Result 1463 states and 2094 transitions. [2022-02-20 18:51:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2094 transitions. [2022-02-20 18:51:23,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 881 states have (on average 1.4517593643586832) internal successors, (1279), 882 states have internal predecessors, (1279), 0 states have call successors, (0), 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 1463 states. [2022-02-20 18:51:23,923 INFO L87 Difference]: Start difference. First operand has 883 states, 881 states have (on average 1.4517593643586832) internal successors, (1279), 882 states have internal predecessors, (1279), 0 states have call successors, (0), 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 1463 states. [2022-02-20 18:51:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:23,983 INFO L93 Difference]: Finished difference Result 1463 states and 2094 transitions. [2022-02-20 18:51:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2094 transitions. [2022-02-20 18:51:23,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:23,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:23,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:23,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.4517593643586832) internal successors, (1279), 882 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1279 transitions. [2022-02-20 18:51:24,018 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1279 transitions. Word has length 54 [2022-02-20 18:51:24,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:24,018 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1279 transitions. [2022-02-20 18:51:24,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1279 transitions. [2022-02-20 18:51:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:24,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:24,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:24,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:51:24,019 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1521991144, now seen corresponding path program 1 times [2022-02-20 18:51:24,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:24,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915667559] [2022-02-20 18:51:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:24,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:24,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {48229#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {48229#true} is VALID [2022-02-20 18:51:24,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {48229#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {48231#(<= ~id2~0 127)} is VALID [2022-02-20 18:51:24,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {48231#(<= ~id2~0 127)} assume 0 == ~r1~0 % 256; {48231#(<= ~id2~0 127)} is VALID [2022-02-20 18:51:24,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {48231#(<= ~id2~0 127)} assume ~id1~0 >= 0; {48232#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:24,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {48232#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} assume 0 == ~st1~0; {48232#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} is VALID [2022-02-20 18:51:24,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {48232#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~id1~0 127)))} assume ~send1~0 == ~id1~0; {48233#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:24,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {48233#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume 0 == ~mode1~0 % 256; {48233#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} is VALID [2022-02-20 18:51:24,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {48233#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0))} assume ~id2~0 >= 0; {48234#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:24,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {48234#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume 0 == ~st2~0; {48234#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:24,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {48234#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0))} assume ~send2~0 == ~id2~0; {48235#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:24,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {48235#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~mode2~0 % 256; {48235#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:24,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {48235#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~id3~0 >= 0; {48236#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:24,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {48236#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume 0 == ~st3~0; {48236#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} is VALID [2022-02-20 18:51:24,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {48236#(and (<= 0 ~id3~0) (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0))} assume ~send3~0 == ~id3~0; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 == ~mode3~0 % 256; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id2~0; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id1~0 != ~id3~0; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~send1~0 != ~nomsg~0; {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {48237#(and (<= 0 ~id1~0) (<= ~id2~0 (+ ~send1~0 127)) (<= 0 ~send2~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {48238#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id2~0 (+ 127 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (<= 0 ~send2~0) (<= 0 ~id2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {48238#(and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (<= ~id2~0 (+ 127 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (<= 0 ~send2~0) (<= 0 ~id2~0) (<= 0 ~send3~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {48239#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {48239#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {48239#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {48239#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume ~send2~0 != ~nomsg~0; {48239#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {48239#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send2~0) (<= 0 ~send3~0))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {48240#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send3~0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:51:24,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {48240#(and (<= 0 ~id1~0) (or (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0))) (<= 0 ~send3~0) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {48241#(and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {48241#(and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {48241#(and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {48241#(and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0))} assume ~send3~0 != ~nomsg~0; {48241#(and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:24,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {48241#(and (<= 0 ~id1~0) (or (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0 (* 256 (div (+ (* (- 1) ~p1_new~0) ~id2~0 128) 256))) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_new~0 1) ~id2~0)) (<= 0 ~send3~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {48242#(or (and (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (<= (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) ~id2~0 129) ~p1_new~0) (<= (+ ~p1_new~0 1) ~id2~0))) (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {48242#(or (and (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (<= (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) ~id2~0 129) ~p1_new~0) (<= (+ ~p1_new~0 1) ~id2~0))) (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ (* (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 256) ~id1~0 ~id3~0 ~id2~0)))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,597 INFO L290 TraceCheckUtils]: 37: Hoare triple {48243#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {48244#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:24,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {48244#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {48244#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:24,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {48244#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {48245#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:24,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {48245#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {48245#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} is VALID [2022-02-20 18:51:24,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {48245#(or (<= (+ ~id2~0 129) ~p1_old~0) (<= (+ ~p1_old~0 ~p2_old~0 1) (+ ~id3~0 ~id2~0)) (<= (+ ~p1_old~0 1) ~id2~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {48246#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,599 INFO L290 TraceCheckUtils]: 42: Hoare triple {48246#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)))} assume main_~node2__m2~1#1 != ~nomsg~0; {48246#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,599 INFO L290 TraceCheckUtils]: 43: Hoare triple {48246#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~id2~0 129) |ULTIMATE.start_main_~node2__m2~1#1|) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)))} assume !(main_~node2__m2~1#1 > ~id2~0); {48247#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:24,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {48247#(or (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| ~p2_old~0 1) (+ ~id3~0 ~id2~0)))} assume main_~node2__m2~1#1 == ~id2~0;~st2~0 := 1; {48248#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:24,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {48248#(<= (+ ~p2_old~0 1) ~id3~0)} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {48248#(<= (+ ~p2_old~0 1) ~id3~0)} is VALID [2022-02-20 18:51:24,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {48248#(<= (+ ~p2_old~0 1) ~id3~0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {48249#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:24,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {48249#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 != ~nomsg~0; {48249#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:24,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {48249#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 > ~id3~0;~send3~0 := main_~node3__m3~1#1; {48230#false} is VALID [2022-02-20 18:51:24,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {48230#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; {48230#false} is VALID [2022-02-20 18:51:24,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {48230#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {48230#false} is VALID [2022-02-20 18:51:24,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {48230#false} assume !(~r1~0 % 256 >= 3); {48230#false} is VALID [2022-02-20 18:51:24,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {48230#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {48230#false} is VALID [2022-02-20 18:51:24,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {48230#false} assume 0 == main_~assert__arg~3#1 % 256; {48230#false} is VALID [2022-02-20 18:51:24,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {48230#false} assume !false; {48230#false} is VALID [2022-02-20 18:51:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:24,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:24,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915667559] [2022-02-20 18:51:24,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915667559] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:24,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:24,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 18:51:24,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538444340] [2022-02-20 18:51:24,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:24,603 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:24,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:24,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:24,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:24,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:51:24,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:51:24,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:24,663 INFO L87 Difference]: Start difference. First operand 883 states and 1279 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:40,725 INFO L93 Difference]: Finished difference Result 3210 states and 4721 transitions. [2022-02-20 18:51:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 18:51:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:51:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 688 transitions. [2022-02-20 18:51:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 688 transitions. [2022-02-20 18:51:40,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 688 transitions. [2022-02-20 18:51:41,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 688 edges. 688 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:41,626 INFO L225 Difference]: With dead ends: 3210 [2022-02-20 18:51:41,626 INFO L226 Difference]: Without dead ends: 2865 [2022-02-20 18:51:41,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=338, Invalid=1554, Unknown=0, NotChecked=0, Total=1892 [2022-02-20 18:51:41,628 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 1111 mSDsluCounter, 3317 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:51:41,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1111 Valid, 3598 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 18:51:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-02-20 18:51:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 883. [2022-02-20 18:51:45,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:51:45,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2865 states. Second operand has 883 states, 881 states have (on average 1.449489216799092) internal successors, (1277), 882 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:45,177 INFO L74 IsIncluded]: Start isIncluded. First operand 2865 states. Second operand has 883 states, 881 states have (on average 1.449489216799092) internal successors, (1277), 882 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:45,177 INFO L87 Difference]: Start difference. First operand 2865 states. Second operand has 883 states, 881 states have (on average 1.449489216799092) internal successors, (1277), 882 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:45,398 INFO L93 Difference]: Finished difference Result 2865 states and 4207 transitions. [2022-02-20 18:51:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4207 transitions. [2022-02-20 18:51:45,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:45,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:45,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 881 states have (on average 1.449489216799092) internal successors, (1277), 882 states have internal predecessors, (1277), 0 states have call successors, (0), 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 2865 states. [2022-02-20 18:51:45,402 INFO L87 Difference]: Start difference. First operand has 883 states, 881 states have (on average 1.449489216799092) internal successors, (1277), 882 states have internal predecessors, (1277), 0 states have call successors, (0), 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 2865 states. [2022-02-20 18:51:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:51:45,625 INFO L93 Difference]: Finished difference Result 2865 states and 4207 transitions. [2022-02-20 18:51:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4207 transitions. [2022-02-20 18:51:45,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:51:45,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:51:45,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:51:45,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:51:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.449489216799092) internal successors, (1277), 882 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1277 transitions. [2022-02-20 18:51:45,658 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1277 transitions. Word has length 55 [2022-02-20 18:51:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:51:45,658 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1277 transitions. [2022-02-20 18:51:45,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1277 transitions. [2022-02-20 18:51:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 18:51:45,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:51:45,659 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:51:45,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 18:51:45,659 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:51:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:51:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash 822613335, now seen corresponding path program 1 times [2022-02-20 18:51:45,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:51:45,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734259883] [2022-02-20 18:51:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:51:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:51:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:51:46,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {59707#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1394~0 := 0;~__return_1467~0 := 0;~__return_1532~0 := 0;~__return_1599~0 := 0;~__return_1677~0 := 0;~__return_1696~0 := 0; {59707#true} is VALID [2022-02-20 18:51:46,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {59707#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~1#1, main_~node3__m3~1#1, main_~node2__m2~1#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {59709#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:46,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {59709#(<= ~id3~0 127)} assume 0 == ~r1~0 % 256; {59709#(<= ~id3~0 127)} is VALID [2022-02-20 18:51:46,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {59709#(<= ~id3~0 127)} assume ~id1~0 >= 0; {59710#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:46,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {59710#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume 0 == ~st1~0; {59710#(and (<= 0 ~id1~0) (<= ~id3~0 127))} is VALID [2022-02-20 18:51:46,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {59710#(and (<= 0 ~id1~0) (<= ~id3~0 127))} assume ~send1~0 == ~id1~0; {59711#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {59711#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume 0 == ~mode1~0 % 256; {59711#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {59711#(and (<= ~send1~0 ~id1~0) (<= ~id3~0 127) (<= 0 ~send1~0))} assume ~id2~0 >= 0; {59712#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {59712#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st2~0; {59712#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {59712#(and (<= ~id3~0 (+ ~id2~0 127)) (<= ~send1~0 ~id1~0) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send2~0 == ~id2~0; {59713#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {59713#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~mode2~0 % 256; {59713#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {59713#(and (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~id3~0 >= 0; {59714#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {59714#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume 0 == ~st3~0; {59714#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {59714#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send2~0 ~send1~0) (+ ~id1~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send1~0))} assume ~send3~0 == ~id3~0; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 == ~mode3~0 % 256; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id2~0; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id1~0 != ~id3~0; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1394~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1394~0; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume 0 != main_~main__i2~0#1;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~send1~0 != ~nomsg~0; {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} is VALID [2022-02-20 18:51:46,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {59715#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~send1~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~id2~0) (<= 0 ~send3~0) (<= 0 ~send1~0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {59716#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0)) (<= 0 ~send3~0))} is VALID [2022-02-20 18:51:46,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {59716#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1| 256) 1) 0)) (<= 0 ~send3~0))} ~p1_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256);~mode1~0 := 1;havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {59717#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} is VALID [2022-02-20 18:51:46,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {59717#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {59717#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} is VALID [2022-02-20 18:51:46,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {59717#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} assume ~send2~0 != ~nomsg~0; {59717#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} is VALID [2022-02-20 18:51:46,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {59717#(and (<= 0 ~id3~0) (<= ~id3~0 (+ ~send2~0 127)) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 ~send2~0 ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {59718#(and (<= 0 ~id3~0) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (<= ~id3~0 (+ |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127)) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0))))} is VALID [2022-02-20 18:51:46,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {59718#(and (<= 0 ~id3~0) (or (and (<= 0 ~id1~0) (<= (+ ~send3~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| ~p1_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0)) (or (<= ~id3~0 (+ |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 127)) (not (<= (+ (div |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1| 256) 1) 0))))} ~p2_new~0 := (if main_~node2____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node2____CPAchecker_TMP_0~0#1 % 256 else main_~node2____CPAchecker_TMP_0~0#1 % 256 - 256);~mode2~0 := 1;havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {59719#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:46,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {59719#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {59719#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:46,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {59719#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~send3~0 != ~nomsg~0; {59719#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:46,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {59719#(or (and (<= (+ ~send3~0 ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= 0 ~send3~0)) (<= (+ ~p2_new~0 1) ~id3~0) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {59720#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} is VALID [2022-02-20 18:51:46,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {59720#(or (<= (+ ~p2_new~0 1) ~id3~0) (and (<= (+ |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~p1_new~0 ~p2_new~0) (+ ~id1~0 ~id3~0 ~id2~0)) (not (<= (+ (div |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| 256) 1) 0))) (<= (+ ~p1_new~0 1) ~id2~0) (<= (+ ~id3~0 129) ~p2_new~0))} ~p3_new~0 := (if main_~node3____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node3____CPAchecker_TMP_0~0#1 % 256 else main_~node3____CPAchecker_TMP_0~0#1 % 256 - 256);~mode3~0 := 1;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:46,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:46,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(~r1~0 % 256 >= 3); {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:46,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:46,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume ~r1~0 % 256 < 3;main_~check__tmp~0#1 := 1;~__return_1467~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1467~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; {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:46,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == main_~assert__arg~0#1 % 256);havoc main_~node1__m1~1#1;main_~node1__m1~1#1 := ~nomsg~0; {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:46,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(0 == ~mode1~0 % 256); {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} is VALID [2022-02-20 18:51:46,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {59721#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p3_old~0 1) ~id1~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0) (<= (+ ~p3_old~0 ~p1_old~0 ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)))} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256;main_~node1__m1~1#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {59722#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {59722#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 != ~nomsg~0; {59722#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {59722#(or (<= (+ |ULTIMATE.start_main_~node1__m1~1#1| 1) ~id1~0) (<= (+ ~p1_old~0 |ULTIMATE.start_main_~node1__m1~1#1| ~p2_old~0) (+ ~id1~0 ~id3~0 ~id2~0)) (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node1__m1~1#1 > ~id1~0;~send1~0 := main_~node1__m1~1#1; {59723#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {59723#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode1~0 := 0;havoc main_~node2__m2~1#1;main_~node2__m2~1#1 := ~nomsg~0; {59723#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {59723#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p1_old~0 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~1#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {59724#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {59724#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 != ~nomsg~0; {59724#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {59724#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ |ULTIMATE.start_main_~node2__m2~1#1| 1) ~id2~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume main_~node2__m2~1#1 > ~id2~0;~send2~0 := main_~node2__m2~1#1; {59725#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {59725#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} ~mode2~0 := 0;havoc main_~node3__m3~1#1;main_~node3__m3~1#1 := ~nomsg~0; {59725#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} is VALID [2022-02-20 18:51:46,229 INFO L290 TraceCheckUtils]: 45: Hoare triple {59725#(or (<= (+ ~id3~0 129) ~p2_old~0) (<= (+ ~p2_old~0 1) ~id3~0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~1#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {59726#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:46,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {59726#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume main_~node3__m3~1#1 != ~nomsg~0; {59726#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} is VALID [2022-02-20 18:51:46,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {59726#(or (<= (+ ~id3~0 129) |ULTIMATE.start_main_~node3__m3~1#1|) (<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0))} assume !(main_~node3__m3~1#1 > ~id3~0); {59727#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} is VALID [2022-02-20 18:51:46,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {59727#(<= (+ |ULTIMATE.start_main_~node3__m3~1#1| 1) ~id3~0)} assume main_~node3__m3~1#1 == ~id3~0;~st3~0 := 1; {59708#false} is VALID [2022-02-20 18:51:46,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {59708#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; {59708#false} is VALID [2022-02-20 18:51:46,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {59708#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {59708#false} is VALID [2022-02-20 18:51:46,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {59708#false} assume !(~r1~0 % 256 >= 3); {59708#false} is VALID [2022-02-20 18:51:46,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {59708#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0;~__return_1677~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1677~0;havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~3#1;main_~assert__arg~3#1 := main_~__tmp_4~0#1; {59708#false} is VALID [2022-02-20 18:51:46,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {59708#false} assume 0 == main_~assert__arg~3#1 % 256; {59708#false} is VALID [2022-02-20 18:51:46,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {59708#false} assume !false; {59708#false} is VALID [2022-02-20 18:51:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:51:46,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:51:46,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734259883] [2022-02-20 18:51:46,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734259883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:51:46,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:51:46,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-20 18:51:46,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892368539] [2022-02-20 18:51:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:51:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 18:51:46,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:51:46,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:51:46,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:51:46,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 18:51:46,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:51:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 18:51:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2022-02-20 18:51:46,276 INFO L87 Difference]: Start difference. First operand 883 states and 1277 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)