./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-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 afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:49:48,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:49:48,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:49:48,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:49:48,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:49:48,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:49:48,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:49:48,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:49:48,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:49:48,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:49:48,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:49:48,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:49:48,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:49:48,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:49:48,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:49:48,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:49:48,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:49:48,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:49:48,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:49:48,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:49:48,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:49:48,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:49:48,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:49:48,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:49:48,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:49:48,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:49:48,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:49:48,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:49:48,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:49:48,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:49:48,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:49:48,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:49:48,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:49:48,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:49:48,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:49:48,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:49:48,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:49:48,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:49:48,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:49:48,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:49:48,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:49:48,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:49:48,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:49:48,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:49:48,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:49:48,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:49:48,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:49:48,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:49:48,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:49:48,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:49:48,749 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:49:48,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:49:48,749 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:49:48,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:49:48,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:49:48,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:49:48,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:49:48,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:49:48,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:49:48,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:49:48,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:49:48,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:49:48,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:49:48,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:49:48,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:49:48,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:49:48,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:48,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:49:48,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:49:48,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:49:48,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:49:48,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:49:48,753 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:49:48,753 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:49:48,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:49:48,754 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 -> afac0863a681e4712e7bffaf04a415cd693c6153e1fe439605f11a4c250fdcc1 [2022-02-20 18:49:48,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:49:48,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:49:48,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:49:48,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:49:48,968 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:49:48,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:49:49,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6834f6122/d54cf7fbf0ca45249c8f0db11dd5280b/FLAGb3c1e8d32 [2022-02-20 18:49:49,417 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:49:49,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:49:49,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6834f6122/d54cf7fbf0ca45249c8f0db11dd5280b/FLAGb3c1e8d32 [2022-02-20 18:49:49,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6834f6122/d54cf7fbf0ca45249c8f0db11dd5280b [2022-02-20 18:49:49,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:49:49,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:49:49,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:49,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:49:49,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:49:49,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cc166b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49, skipping insertion in model container [2022-02-20 18:49:49,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:49:49,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:49:49,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2022-02-20 18:49:49,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:49,674 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:49:49,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4069,4082] [2022-02-20 18:49:49,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:49:49,749 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:49:49,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49 WrapperNode [2022-02-20 18:49:49,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:49:49,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:49,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:49:49,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:49:49,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,818 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 271 [2022-02-20 18:49:49,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:49:49,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:49:49,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:49:49,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:49:49,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:49:49,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:49:49,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:49:49,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:49:49,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (1/1) ... [2022-02-20 18:49:49,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:49:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:49:49,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:49:49,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:49:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:49:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:49:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:49:49,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:49:50,053 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:49:50,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:49:50,493 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:49:50,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:49:50,503 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:49:50,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:50 BoogieIcfgContainer [2022-02-20 18:49:50,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:49:50,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:49:50,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:49:50,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:49:50,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:49:49" (1/3) ... [2022-02-20 18:49:50,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72386594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:50, skipping insertion in model container [2022-02-20 18:49:50,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:49:49" (2/3) ... [2022-02-20 18:49:50,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72386594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:49:50, skipping insertion in model container [2022-02-20 18:49:50,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:49:50" (3/3) ... [2022-02-20 18:49:50,513 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2022-02-20 18:49:50,517 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:49:50,517 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:49:50,572 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:49:50,578 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:49:50,578 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:49:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 18:49:50,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:50,631 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] [2022-02-20 18:49:50,632 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1007825277, now seen corresponding path program 1 times [2022-02-20 18:49:50,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:50,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495027475] [2022-02-20 18:49:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:50,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {65#true} is VALID [2022-02-20 18:49:50,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {65#true} is VALID [2022-02-20 18:49:50,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {65#true} assume 0 == ~r1~0; {65#true} is VALID [2022-02-20 18:49:50,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#true} assume ~id1~0 >= 0; {65#true} is VALID [2022-02-20 18:49:50,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {65#true} assume 0 == ~st1~0; {65#true} is VALID [2022-02-20 18:49:50,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {65#true} assume ~send1~0 == ~id1~0; {65#true} is VALID [2022-02-20 18:49:50,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {65#true} assume 0 == ~mode1~0 % 256; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:49:50,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {67#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:49:50,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {66#false} assume !(main_~node1__m1~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:49:50,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {66#false} ~mode1~0 := 0; {66#false} is VALID [2022-02-20 18:49:50,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {66#false} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:49:50,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {66#false} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:49:50,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {66#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:49:50,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {66#false} ~mode2~0 := 0; {66#false} is VALID [2022-02-20 18:49:50,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {66#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:49:50,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {66#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {66#false} is VALID [2022-02-20 18:49:50,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {66#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {66#false} is VALID [2022-02-20 18:49:50,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {66#false} ~mode3~0 := 0; {66#false} is VALID [2022-02-20 18:49:50,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {66#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {66#false} is VALID [2022-02-20 18:49:50,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {66#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {66#false} is VALID [2022-02-20 18:49:50,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {66#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {66#false} is VALID [2022-02-20 18:49:50,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {66#false} assume 0 == main_~assert__arg~0#1 % 256; {66#false} is VALID [2022-02-20 18:49:50,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {66#false} assume !false; {66#false} is VALID [2022-02-20 18:49:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:50,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:50,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495027475] [2022-02-20 18:49:50,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495027475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:50,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:50,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:50,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989731894] [2022-02-20 18:49:50,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:51,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-02-20 18:49:51,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:51,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:51,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:51,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:51,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:51,082 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 61 states have internal predecessors, (103), 0 states have call successors, (0), 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 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:51,318 INFO L93 Difference]: Finished difference Result 140 states and 224 transitions. [2022-02-20 18:49:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-02-20 18:49:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 18:49:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 18:49:51,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2022-02-20 18:49:51,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:51,555 INFO L225 Difference]: With dead ends: 140 [2022-02-20 18:49:51,555 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 18:49:51,557 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:49:51,562 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:51,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 18:49:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-02-20 18:49:51,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:51,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,599 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,600 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:51,605 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2022-02-20 18:49:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2022-02-20 18:49:51,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:51,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:51,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 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 91 states. [2022-02-20 18:49:51,607 INFO L87 Difference]: Start difference. First operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 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 91 states. [2022-02-20 18:49:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:51,612 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2022-02-20 18:49:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2022-02-20 18:49:51,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:51,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:51,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:51,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 130 transitions. [2022-02-20 18:49:51,618 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 130 transitions. Word has length 36 [2022-02-20 18:49:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:51,618 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 130 transitions. [2022-02-20 18:49:51,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 130 transitions. [2022-02-20 18:49:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:49:51,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:51,620 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] [2022-02-20 18:49:51,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:49:51,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1176817218, now seen corresponding path program 1 times [2022-02-20 18:49:51,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:51,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118977260] [2022-02-20 18:49:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:51,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {553#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {553#true} is VALID [2022-02-20 18:49:51,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {553#true} is VALID [2022-02-20 18:49:51,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {553#true} assume 0 == ~r1~0; {553#true} is VALID [2022-02-20 18:49:51,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {553#true} assume ~id1~0 >= 0; {553#true} is VALID [2022-02-20 18:49:51,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {553#true} assume 0 == ~st1~0; {553#true} is VALID [2022-02-20 18:49:51,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {553#true} assume ~send1~0 == ~id1~0; {553#true} is VALID [2022-02-20 18:49:51,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#true} assume 0 == ~mode1~0 % 256; {553#true} is VALID [2022-02-20 18:49:51,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#true} assume ~id2~0 >= 0; {553#true} is VALID [2022-02-20 18:49:51,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#true} assume 0 == ~st2~0; {553#true} is VALID [2022-02-20 18:49:51,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {553#true} assume ~send2~0 == ~id2~0; {553#true} is VALID [2022-02-20 18:49:51,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#true} assume 0 == ~mode2~0 % 256; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~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; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:49:51,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {555#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {554#false} is VALID [2022-02-20 18:49:51,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {554#false} assume !(main_~node2__m2~0#1 != ~nomsg~0); {554#false} is VALID [2022-02-20 18:49:51,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {554#false} ~mode2~0 := 0; {554#false} is VALID [2022-02-20 18:49:51,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {554#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {554#false} is VALID [2022-02-20 18:49:51,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {554#false} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {554#false} is VALID [2022-02-20 18:49:51,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {554#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {554#false} is VALID [2022-02-20 18:49:51,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {554#false} ~mode3~0 := 0; {554#false} is VALID [2022-02-20 18:49:51,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {554#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {554#false} is VALID [2022-02-20 18:49:51,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {554#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {554#false} is VALID [2022-02-20 18:49:51,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {554#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {554#false} is VALID [2022-02-20 18:49:51,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {554#false} assume 0 == main_~assert__arg~0#1 % 256; {554#false} is VALID [2022-02-20 18:49:51,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {554#false} assume !false; {554#false} is VALID [2022-02-20 18:49:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:51,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:51,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118977260] [2022-02-20 18:49:51,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118977260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:51,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:51,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:51,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730438252] [2022-02-20 18:49:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:49:51,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:51,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:51,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:51,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:51,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:51,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:51,782 INFO L87 Difference]: Start difference. First operand 89 states and 130 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:51,947 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2022-02-20 18:49:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:51,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 18:49:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:49:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:49:51,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2022-02-20 18:49:52,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:52,121 INFO L225 Difference]: With dead ends: 213 [2022-02-20 18:49:52,122 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 18:49:52,124 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:49:52,125 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:52,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 182 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 18:49:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-02-20 18:49:52,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:52,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,141 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,141 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:52,155 INFO L93 Difference]: Finished difference Result 143 states and 213 transitions. [2022-02-20 18:49:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2022-02-20 18:49:52,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:52,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:52,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:49:52,159 INFO L87 Difference]: Start difference. First operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 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 143 states. [2022-02-20 18:49:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:52,166 INFO L93 Difference]: Finished difference Result 143 states and 213 transitions. [2022-02-20 18:49:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2022-02-20 18:49:52,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:52,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:52,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:52,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5142857142857142) internal successors, (212), 140 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2022-02-20 18:49:52,177 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 37 [2022-02-20 18:49:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:52,179 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2022-02-20 18:49:52,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2022-02-20 18:49:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:49:52,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:52,183 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] [2022-02-20 18:49:52,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:49:52,186 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash 761408425, now seen corresponding path program 1 times [2022-02-20 18:49:52,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:52,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432417664] [2022-02-20 18:49:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:52,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {1321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {1321#true} is VALID [2022-02-20 18:49:52,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {1321#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {1321#true} is VALID [2022-02-20 18:49:52,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {1321#true} assume 0 == ~r1~0; {1321#true} is VALID [2022-02-20 18:49:52,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {1321#true} assume ~id1~0 >= 0; {1321#true} is VALID [2022-02-20 18:49:52,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {1321#true} assume 0 == ~st1~0; {1321#true} is VALID [2022-02-20 18:49:52,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1321#true} assume ~send1~0 == ~id1~0; {1321#true} is VALID [2022-02-20 18:49:52,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {1321#true} assume 0 == ~mode1~0 % 256; {1321#true} is VALID [2022-02-20 18:49:52,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {1321#true} assume ~id2~0 >= 0; {1321#true} is VALID [2022-02-20 18:49:52,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {1321#true} assume 0 == ~st2~0; {1321#true} is VALID [2022-02-20 18:49:52,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {1321#true} assume ~send2~0 == ~id2~0; {1321#true} is VALID [2022-02-20 18:49:52,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {1321#true} assume 0 == ~mode2~0 % 256; {1321#true} is VALID [2022-02-20 18:49:52,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {1321#true} assume ~id3~0 >= 0; {1321#true} is VALID [2022-02-20 18:49:52,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#true} assume 0 == ~st3~0; {1321#true} is VALID [2022-02-20 18:49:52,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {1321#true} assume ~send3~0 == ~id3~0; {1321#true} is VALID [2022-02-20 18:49:52,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {1321#true} assume 0 == ~mode3~0 % 256; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~nomsg~0); {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~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; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:49:52,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {1323#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1322#false} is VALID [2022-02-20 18:49:52,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {1322#false} assume !(main_~node3__m3~0#1 != ~nomsg~0); {1322#false} is VALID [2022-02-20 18:49:52,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {1322#false} ~mode3~0 := 0; {1322#false} is VALID [2022-02-20 18:49:52,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {1322#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1322#false} is VALID [2022-02-20 18:49:52,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {1322#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1322#false} is VALID [2022-02-20 18:49:52,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {1322#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {1322#false} is VALID [2022-02-20 18:49:52,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {1322#false} assume 0 == main_~assert__arg~0#1 % 256; {1322#false} is VALID [2022-02-20 18:49:52,276 INFO L290 TraceCheckUtils]: 37: Hoare triple {1322#false} assume !false; {1322#false} is VALID [2022-02-20 18:49:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:52,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:52,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432417664] [2022-02-20 18:49:52,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432417664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:52,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:52,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:52,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889290856] [2022-02-20 18:49:52,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:49:52,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:52,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:52,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:52,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:52,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:52,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:52,307 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:52,448 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2022-02-20 18:49:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 18:49:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:49:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 18:49:52,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2022-02-20 18:49:52,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:52,606 INFO L225 Difference]: With dead ends: 353 [2022-02-20 18:49:52,606 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 18:49:52,607 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:49:52,608 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:52,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 18:49:52,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-02-20 18:49:52,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:52,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,637 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,638 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:52,645 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2022-02-20 18:49:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 349 transitions. [2022-02-20 18:49:52,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:52,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:52,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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 231 states. [2022-02-20 18:49:52,647 INFO L87 Difference]: Start difference. First operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 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 231 states. [2022-02-20 18:49:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:52,654 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2022-02-20 18:49:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 349 transitions. [2022-02-20 18:49:52,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:52,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:52,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:52,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 228 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 348 transitions. [2022-02-20 18:49:52,663 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 348 transitions. Word has length 38 [2022-02-20 18:49:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:52,663 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 348 transitions. [2022-02-20 18:49:52,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 348 transitions. [2022-02-20 18:49:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:49:52,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:52,664 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] [2022-02-20 18:49:52,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:49:52,665 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2014631486, now seen corresponding path program 1 times [2022-02-20 18:49:52,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:52,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003669462] [2022-02-20 18:49:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:52,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {2586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {2586#true} is VALID [2022-02-20 18:49:52,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {2586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {2586#true} is VALID [2022-02-20 18:49:52,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {2586#true} assume 0 == ~r1~0; {2586#true} is VALID [2022-02-20 18:49:52,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {2586#true} assume ~id1~0 >= 0; {2586#true} is VALID [2022-02-20 18:49:52,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {2586#true} assume 0 == ~st1~0; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:52,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {2588#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:52,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {2588#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:52,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {2588#(<= ~st1~0 0)} assume ~id2~0 >= 0; {2588#(<= ~st1~0 0)} is VALID [2022-02-20 18:49:52,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {2588#(<= ~st1~0 0)} assume 0 == ~st2~0; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {2589#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {2589#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {2590#(<= (+ ~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; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#(<= (+ ~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; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~nomsg~0); {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#(<= (+ ~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; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#(<= (+ ~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; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:49:52,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {2590#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {2587#false} is VALID [2022-02-20 18:49:52,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {2587#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {2587#false} is VALID [2022-02-20 18:49:52,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {2587#false} assume 0 == main_~assert__arg~0#1 % 256; {2587#false} is VALID [2022-02-20 18:49:52,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {2587#false} assume !false; {2587#false} is VALID [2022-02-20 18:49:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:52,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:52,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003669462] [2022-02-20 18:49:52,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003669462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:52,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:52,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:49:52,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149194592] [2022-02-20 18:49:52,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:49:52,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:52,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:52,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:52,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:52,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:52,812 INFO L87 Difference]: Start difference. First operand 229 states and 348 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:53,802 INFO L93 Difference]: Finished difference Result 1489 states and 2322 transitions. [2022-02-20 18:49:53,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:49:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-02-20 18:49:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 460 transitions. [2022-02-20 18:49:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 460 transitions. [2022-02-20 18:49:53,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 460 transitions. [2022-02-20 18:49:54,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:54,258 INFO L225 Difference]: With dead ends: 1489 [2022-02-20 18:49:54,259 INFO L226 Difference]: Without dead ends: 1279 [2022-02-20 18:49:54,260 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:49:54,261 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 423 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:54,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 419 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2022-02-20 18:49:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 437. [2022-02-20 18:49:54,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:54,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1279 states. Second operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,485 INFO L74 IsIncluded]: Start isIncluded. First operand 1279 states. Second operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,486 INFO L87 Difference]: Start difference. First operand 1279 states. Second operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:54,583 INFO L93 Difference]: Finished difference Result 1279 states and 1945 transitions. [2022-02-20 18:49:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1945 transitions. [2022-02-20 18:49:54,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:54,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:54,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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 1279 states. [2022-02-20 18:49:54,588 INFO L87 Difference]: Start difference. First operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 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 1279 states. [2022-02-20 18:49:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:54,671 INFO L93 Difference]: Finished difference Result 1279 states and 1945 transitions. [2022-02-20 18:49:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1945 transitions. [2022-02-20 18:49:54,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:54,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:54,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:54,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 1.5137614678899083) internal successors, (660), 436 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2022-02-20 18:49:54,691 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 39 [2022-02-20 18:49:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:54,693 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 660 transitions. [2022-02-20 18:49:54,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 660 transitions. [2022-02-20 18:49:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:49:54,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:54,694 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] [2022-02-20 18:49:54,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:49:54,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215654, now seen corresponding path program 1 times [2022-02-20 18:49:54,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:54,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972749513] [2022-02-20 18:49:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:54,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {7840#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {7840#true} is VALID [2022-02-20 18:49:54,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {7840#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {7840#true} is VALID [2022-02-20 18:49:54,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {7840#true} assume 0 == ~r1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {7842#(<= ~r1~0 0)} assume ~id1~0 >= 0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~st1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {7842#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {7842#(<= ~r1~0 0)} assume ~id2~0 >= 0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~st2~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {7842#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {7842#(<= ~r1~0 0)} assume ~id3~0 >= 0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~st3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {7842#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {7842#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {7842#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {7842#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {7842#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {7842#(<= ~r1~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; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {7842#(<= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {7842#(<= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {7842#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {7842#(<= ~r1~0 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {7842#(<= ~r1~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; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {7842#(<= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {7842#(<= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {7842#(<= ~r1~0 0)} assume !(~send2~0 != ~nomsg~0); {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {7842#(<= ~r1~0 0)} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {7842#(<= ~r1~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; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {7842#(<= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {7842#(<= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {7842#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {7842#(<= ~r1~0 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {7842#(<= ~r1~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; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {7842#(<= ~r1~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~0#1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {7842#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {7842#(<= ~r1~0 0)} is VALID [2022-02-20 18:49:54,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {7842#(<= ~r1~0 0)} assume ~r1~0 >= 3; {7841#false} is VALID [2022-02-20 18:49:54,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {7841#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {7841#false} is VALID [2022-02-20 18:49:54,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {7841#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {7841#false} is VALID [2022-02-20 18:49:54,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {7841#false} assume 0 == main_~assert__arg~0#1 % 256; {7841#false} is VALID [2022-02-20 18:49:54,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {7841#false} assume !false; {7841#false} is VALID [2022-02-20 18:49:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:54,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:54,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972749513] [2022-02-20 18:49:54,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972749513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:54,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:54,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:49:54,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471464137] [2022-02-20 18:49:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:54,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:49:54,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:54,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:54,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:54,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:49:54,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:49:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:49:54,843 INFO L87 Difference]: Start difference. First operand 437 states and 660 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:55,357 INFO L93 Difference]: Finished difference Result 1055 states and 1604 transitions. [2022-02-20 18:49:55,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:49:55,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:49:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2022-02-20 18:49:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions. [2022-02-20 18:49:55,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 199 transitions. [2022-02-20 18:49:55,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:55,513 INFO L225 Difference]: With dead ends: 1055 [2022-02-20 18:49:55,513 INFO L226 Difference]: Without dead ends: 637 [2022-02-20 18:49:55,514 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:49:55,515 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:55,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 154 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-02-20 18:49:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2022-02-20 18:49:55,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:55,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,894 INFO L74 IsIncluded]: Start isIncluded. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,895 INFO L87 Difference]: Start difference. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:55,928 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2022-02-20 18:49:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 951 transitions. [2022-02-20 18:49:55,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:55,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:55,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:49:55,932 INFO L87 Difference]: Start difference. First operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:49:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:55,955 INFO L93 Difference]: Finished difference Result 637 states and 951 transitions. [2022-02-20 18:49:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 951 transitions. [2022-02-20 18:49:55,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:55,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:55,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:55,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.498422712933754) internal successors, (950), 634 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 950 transitions. [2022-02-20 18:49:55,985 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 950 transitions. Word has length 41 [2022-02-20 18:49:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:55,986 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 950 transitions. [2022-02-20 18:49:55,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 950 transitions. [2022-02-20 18:49:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 18:49:55,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:55,987 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] [2022-02-20 18:49:55,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:49:55,987 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:55,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1870212999, now seen corresponding path program 1 times [2022-02-20 18:49:55,988 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:55,988 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083864806] [2022-02-20 18:49:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:56,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {11483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {11483#true} is VALID [2022-02-20 18:49:56,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {11483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {11483#true} is VALID [2022-02-20 18:49:56,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {11483#true} assume 0 == ~r1~0; {11483#true} is VALID [2022-02-20 18:49:56,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {11483#true} assume ~id1~0 >= 0; {11483#true} is VALID [2022-02-20 18:49:56,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {11483#true} assume 0 == ~st1~0; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:49:56,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:49:56,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:49:56,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 18:49:56,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {11485#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:49:56,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:49:56,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:49:56,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:49:56,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {11486#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~send2~0 != ~nomsg~0); {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~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; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:49:56,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {11487#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {11484#false} is VALID [2022-02-20 18:49:56,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {11484#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {11484#false} is VALID [2022-02-20 18:49:56,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {11484#false} assume 0 == main_~assert__arg~0#1 % 256; {11484#false} is VALID [2022-02-20 18:49:56,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {11484#false} assume !false; {11484#false} is VALID [2022-02-20 18:49:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:56,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:56,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083864806] [2022-02-20 18:49:56,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083864806] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:56,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:56,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:49:56,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021662122] [2022-02-20 18:49:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:56,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:49:56,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:56,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:56,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:56,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:56,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:56,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:56,158 INFO L87 Difference]: Start difference. First operand 635 states and 950 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:57,018 INFO L93 Difference]: Finished difference Result 1251 states and 1880 transitions. [2022-02-20 18:49:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 18:49:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2022-02-20 18:49:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2022-02-20 18:49:57,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 206 transitions. [2022-02-20 18:49:57,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:57,204 INFO L225 Difference]: With dead ends: 1251 [2022-02-20 18:49:57,205 INFO L226 Difference]: Without dead ends: 637 [2022-02-20 18:49:57,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:49:57,208 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 171 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:57,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 195 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-02-20 18:49:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2022-02-20 18:49:57,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:49:57,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,656 INFO L74 IsIncluded]: Start isIncluded. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,657 INFO L87 Difference]: Start difference. First operand 637 states. Second operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:57,678 INFO L93 Difference]: Finished difference Result 637 states and 939 transitions. [2022-02-20 18:49:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 939 transitions. [2022-02-20 18:49:57,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:57,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:57,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:49:57,682 INFO L87 Difference]: Start difference. First operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 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 637 states. [2022-02-20 18:49:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:57,702 INFO L93 Difference]: Finished difference Result 637 states and 939 transitions. [2022-02-20 18:49:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 939 transitions. [2022-02-20 18:49:57,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:49:57,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:49:57,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:49:57,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:49:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4794952681388012) internal successors, (938), 634 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 938 transitions. [2022-02-20 18:49:57,734 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 938 transitions. Word has length 41 [2022-02-20 18:49:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:49:57,734 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 938 transitions. [2022-02-20 18:49:57,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 938 transitions. [2022-02-20 18:49:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:49:57,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:49:57,735 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] [2022-02-20 18:49:57,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:49:57,736 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:49:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:49:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2143937547, now seen corresponding path program 1 times [2022-02-20 18:49:57,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:49:57,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878598298] [2022-02-20 18:49:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:49:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:49:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:49:57,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {15410#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~st1~0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume ~send1~0 == ~id1~0; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~mode1~0 % 256; {15412#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:49:57,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {15412#(<= (+ ~nomsg~0 1) 0)} assume ~id2~0 >= 0; {15413#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:49:57,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {15413#(<= (+ ~nomsg~0 1) ~id2~0)} assume 0 == ~st2~0; {15413#(<= (+ ~nomsg~0 1) ~id2~0)} is VALID [2022-02-20 18:49:57,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {15413#(<= (+ ~nomsg~0 1) ~id2~0)} assume ~send2~0 == ~id2~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode2~0 % 256; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id3~0 >= 0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~st3~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send3~0 == ~id3~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume 0 == ~mode3~0 % 256; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id2~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id1~0 != ~id3~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {15414#(<= (+ ~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; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~send1~0 != ~nomsg~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {15414#(<= (+ ~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; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {15414#(<= (+ ~nomsg~0 1) ~send2~0)} is VALID [2022-02-20 18:49:57,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {15414#(<= (+ ~nomsg~0 1) ~send2~0)} assume !(~send2~0 != ~nomsg~0); {15411#false} is VALID [2022-02-20 18:49:57,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {15411#false} main_~node2____CPAchecker_TMP_0~0#1 := ~p2_new~0; {15411#false} is VALID [2022-02-20 18:49:57,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {15411#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; {15411#false} is VALID [2022-02-20 18:49:57,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {15411#false} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {15411#false} is VALID [2022-02-20 18:49:57,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {15411#false} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {15411#false} is VALID [2022-02-20 18:49:57,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {15411#false} assume ~send3~0 != ~nomsg~0; {15411#false} is VALID [2022-02-20 18:49:57,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {15411#false} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {15411#false} is VALID [2022-02-20 18:49:57,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {15411#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; {15411#false} is VALID [2022-02-20 18:49:57,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {15411#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {15411#false} is VALID [2022-02-20 18:49:57,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {15411#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {15411#false} is VALID [2022-02-20 18:49:57,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {15411#false} assume !(~r1~0 >= 3); {15411#false} is VALID [2022-02-20 18:49:57,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {15411#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {15411#false} is VALID [2022-02-20 18:49:57,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {15411#false} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {15411#false} is VALID [2022-02-20 18:49:57,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {15411#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {15411#false} is VALID [2022-02-20 18:49:57,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {15411#false} assume 0 == main_~assert__arg~0#1 % 256; {15411#false} is VALID [2022-02-20 18:49:57,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {15411#false} assume !false; {15411#false} is VALID [2022-02-20 18:49:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:49:57,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:49:57,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878598298] [2022-02-20 18:49:57,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878598298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:49:57,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:49:57,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:49:57,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220197490] [2022-02-20 18:49:57,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:49:57,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:49:57,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:49:57,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:57,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:57,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:49:57,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:49:57,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:49:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:49:57,901 INFO L87 Difference]: Start difference. First operand 635 states and 938 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:49:59,008 INFO L93 Difference]: Finished difference Result 1249 states and 1855 transitions. [2022-02-20 18:49:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:49:59,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:49:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:49:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-02-20 18:49:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:49:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-02-20 18:49:59,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 145 transitions. [2022-02-20 18:49:59,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:49:59,151 INFO L225 Difference]: With dead ends: 1249 [2022-02-20 18:49:59,152 INFO L226 Difference]: Without dead ends: 635 [2022-02-20 18:49:59,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:49:59,155 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 198 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:49:59,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:49:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-02-20 18:50:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2022-02-20 18:50:00,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:00,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:00,141 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:00,142 INFO L87 Difference]: Start difference. First operand 635 states. Second operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:00,162 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2022-02-20 18:50:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 926 transitions. [2022-02-20 18:50:00,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:00,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:00,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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 635 states. [2022-02-20 18:50:00,166 INFO L87 Difference]: Start difference. First operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 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 635 states. [2022-02-20 18:50:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:00,186 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2022-02-20 18:50:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 926 transitions. [2022-02-20 18:50:00,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:00,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:00,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:00,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4605678233438486) internal successors, (926), 634 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 926 transitions. [2022-02-20 18:50:00,227 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 926 transitions. Word has length 42 [2022-02-20 18:50:00,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:00,227 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 926 transitions. [2022-02-20 18:50:00,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 926 transitions. [2022-02-20 18:50:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 18:50:00,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:00,228 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] [2022-02-20 18:50:00,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:50:00,229 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1278405158, now seen corresponding path program 1 times [2022-02-20 18:50:00,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:00,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432845781] [2022-02-20 18:50:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:00,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {19333#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {19333#true} is VALID [2022-02-20 18:50:00,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {19333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {19333#true} is VALID [2022-02-20 18:50:00,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {19333#true} assume 0 == ~r1~0; {19333#true} is VALID [2022-02-20 18:50:00,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {19333#true} assume ~id1~0 >= 0; {19333#true} is VALID [2022-02-20 18:50:00,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {19333#true} assume 0 == ~st1~0; {19333#true} is VALID [2022-02-20 18:50:00,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {19333#true} assume ~send1~0 == ~id1~0; {19333#true} is VALID [2022-02-20 18:50:00,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {19333#true} assume 0 == ~mode1~0 % 256; {19333#true} is VALID [2022-02-20 18:50:00,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {19333#true} assume ~id2~0 >= 0; {19333#true} is VALID [2022-02-20 18:50:00,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {19333#true} assume 0 == ~st2~0; {19333#true} is VALID [2022-02-20 18:50:00,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {19333#true} assume ~send2~0 == ~id2~0; {19333#true} is VALID [2022-02-20 18:50:00,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {19333#true} assume 0 == ~mode2~0 % 256; {19333#true} is VALID [2022-02-20 18:50:00,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {19333#true} assume ~id3~0 >= 0; {19333#true} is VALID [2022-02-20 18:50:00,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {19333#true} assume 0 == ~st3~0; {19333#true} is VALID [2022-02-20 18:50:00,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {19333#true} assume ~send3~0 == ~id3~0; {19333#true} is VALID [2022-02-20 18:50:00,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {19333#true} assume 0 == ~mode3~0 % 256; {19333#true} is VALID [2022-02-20 18:50:00,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {19333#true} assume ~id1~0 != ~id2~0; {19333#true} is VALID [2022-02-20 18:50:00,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {19333#true} assume ~id1~0 != ~id3~0; {19333#true} is VALID [2022-02-20 18:50:00,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {19333#true} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {19335#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} is VALID [2022-02-20 18:50:00,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {19335#(= |ULTIMATE.start_main_~main__i2~0#1| 1)} 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; {19333#true} is VALID [2022-02-20 18:50:00,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {19333#true} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:00,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {19333#true} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {19333#true} is VALID [2022-02-20 18:50:00,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {19333#true} assume ~send1~0 != ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:00,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {19333#true} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {19333#true} is VALID [2022-02-20 18:50:00,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {19333#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; {19333#true} is VALID [2022-02-20 18:50:00,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {19333#true} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:00,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {19333#true} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {19333#true} is VALID [2022-02-20 18:50:00,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {19333#true} assume ~send2~0 != ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:00,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {19333#true} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {19333#true} is VALID [2022-02-20 18:50:00,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {19333#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; {19333#true} is VALID [2022-02-20 18:50:00,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {19333#true} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:00,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {19333#true} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {19333#true} is VALID [2022-02-20 18:50:00,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {19333#true} assume ~send3~0 != ~nomsg~0; {19333#true} is VALID [2022-02-20 18:50:00,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {19333#true} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {19333#true} is VALID [2022-02-20 18:50:00,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {19333#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; {19333#true} is VALID [2022-02-20 18:50:00,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {19333#true} ~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; {19333#true} is VALID [2022-02-20 18:50:00,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {19333#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {19333#true} is VALID [2022-02-20 18:50:00,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {19333#true} assume !(~r1~0 >= 3); {19333#true} is VALID [2022-02-20 18:50:00,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {19333#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {19333#true} is VALID [2022-02-20 18:50:00,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {19333#true} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {19336#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} is VALID [2022-02-20 18:50:00,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {19336#(not (= |ULTIMATE.start_main_~check__tmp~0#1| 0))} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {19337#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} is VALID [2022-02-20 18:50:00,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {19337#(and (<= 1 |ULTIMATE.start_main_~assert__arg~0#1|) (<= (div |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))} assume 0 == main_~assert__arg~0#1 % 256; {19334#false} is VALID [2022-02-20 18:50:00,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {19334#false} assume !false; {19334#false} is VALID [2022-02-20 18:50:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:00,330 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:00,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432845781] [2022-02-20 18:50:00,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432845781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:00,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:00,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:00,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142671425] [2022-02-20 18:50:00,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:00,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:50:00,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:00,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:00,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:00,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:00,360 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:00,361 INFO L87 Difference]: Start difference. First operand 635 states and 926 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:02,387 INFO L93 Difference]: Finished difference Result 1143 states and 1658 transitions. [2022-02-20 18:50:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:50:02,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 18:50:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 18:50:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 18:50:02,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 145 transitions. [2022-02-20 18:50:02,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:02,546 INFO L225 Difference]: With dead ends: 1143 [2022-02-20 18:50:02,546 INFO L226 Difference]: Without dead ends: 1141 [2022-02-20 18:50:02,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:50:02,547 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 108 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:02,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 361 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-02-20 18:50:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 667. [2022-02-20 18:50:03,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:03,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1141 states. Second operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call 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:03,645 INFO L74 IsIncluded]: Start isIncluded. First operand 1141 states. Second operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call 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:03,646 INFO L87 Difference]: Start difference. First operand 1141 states. Second operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call 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:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:03,704 INFO L93 Difference]: Finished difference Result 1141 states and 1637 transitions. [2022-02-20 18:50:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1637 transitions. [2022-02-20 18:50:03,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:03,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:03,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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 1141 states. [2022-02-20 18:50:03,709 INFO L87 Difference]: Start difference. First operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 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 1141 states. [2022-02-20 18:50:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:03,767 INFO L93 Difference]: Finished difference Result 1141 states and 1637 transitions. [2022-02-20 18:50:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1637 transitions. [2022-02-20 18:50:03,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:03,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:03,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:03,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.4324324324324325) internal successors, (954), 666 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call 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:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 954 transitions. [2022-02-20 18:50:03,794 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 954 transitions. Word has length 42 [2022-02-20 18:50:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:03,794 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 954 transitions. [2022-02-20 18:50:03,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call 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:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 954 transitions. [2022-02-20 18:50:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:50:03,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:03,795 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:50:03,796 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1616122195, now seen corresponding path program 1 times [2022-02-20 18:50:03,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:03,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828685616] [2022-02-20 18:50:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:03,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {24188#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {24188#true} is VALID [2022-02-20 18:50:03,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {24188#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {24188#true} is VALID [2022-02-20 18:50:03,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {24188#true} assume 0 == ~r1~0; {24188#true} is VALID [2022-02-20 18:50:03,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {24188#true} assume ~id1~0 >= 0; {24188#true} is VALID [2022-02-20 18:50:03,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {24188#true} assume 0 == ~st1~0; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:03,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {24190#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:03,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {24190#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:03,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {24190#(<= ~st1~0 0)} assume ~id2~0 >= 0; {24190#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:03,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {24190#(<= ~st1~0 0)} assume 0 == ~st2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {24191#(<= (+ ~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; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {24191#(<= (+ ~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; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {24191#(<= (+ ~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; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {24191#(<= (+ ~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; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} ~mode2~0 := 0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 != ~nomsg~0; {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume !(main_~node3__m3~0#1 > ~id3~0); {24191#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:03,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {24191#(<= (+ ~st2~0 ~st1~0) 0)} assume main_~node3__m3~0#1 == ~id3~0;~st3~0 := 1; {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:03,888 INFO L290 TraceCheckUtils]: 54: Hoare triple {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:03,889 INFO L290 TraceCheckUtils]: 55: Hoare triple {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:03,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {24192#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {24189#false} is VALID [2022-02-20 18:50:03,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {24189#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {24189#false} is VALID [2022-02-20 18:50:03,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {24189#false} assume 0 == main_~assert__arg~0#1 % 256; {24189#false} is VALID [2022-02-20 18:50:03,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {24189#false} assume !false; {24189#false} is VALID [2022-02-20 18:50:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:50:03,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:03,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828685616] [2022-02-20 18:50:03,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828685616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:03,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:03,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:03,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031897577] [2022-02-20 18:50:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:03,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:50:03,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:03,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:03,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:03,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:03,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:03,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:03,933 INFO L87 Difference]: Start difference. First operand 667 states and 954 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:07,709 INFO L93 Difference]: Finished difference Result 2735 states and 3928 transitions. [2022-02-20 18:50:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:50:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:50:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:50:07,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 326 transitions. [2022-02-20 18:50:07,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:08,104 INFO L225 Difference]: With dead ends: 2735 [2022-02-20 18:50:08,105 INFO L226 Difference]: Without dead ends: 2089 [2022-02-20 18:50:08,105 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:08,106 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 212 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:08,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 332 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-02-20 18:50:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1311. [2022-02-20 18:50:10,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:10,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2089 states. Second operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call 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:10,106 INFO L74 IsIncluded]: Start isIncluded. First operand 2089 states. Second operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call 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:10,108 INFO L87 Difference]: Start difference. First operand 2089 states. Second operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call 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:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:10,233 INFO L93 Difference]: Finished difference Result 2089 states and 2983 transitions. [2022-02-20 18:50:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2983 transitions. [2022-02-20 18:50:10,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:10,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:10,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 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 2089 states. [2022-02-20 18:50:10,238 INFO L87 Difference]: Start difference. First operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 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 2089 states. [2022-02-20 18:50:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:10,367 INFO L93 Difference]: Finished difference Result 2089 states and 2983 transitions. [2022-02-20 18:50:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2983 transitions. [2022-02-20 18:50:10,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:10,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:10,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:10,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1310 states have (on average 1.4305343511450381) internal successors, (1874), 1310 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call 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:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1874 transitions. [2022-02-20 18:50:10,446 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1874 transitions. Word has length 60 [2022-02-20 18:50:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:10,446 INFO L470 AbstractCegarLoop]: Abstraction has 1311 states and 1874 transitions. [2022-02-20 18:50:10,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1874 transitions. [2022-02-20 18:50:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:50:10,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:10,447 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:50:10,447 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:10,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1524898995, now seen corresponding path program 1 times [2022-02-20 18:50:10,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:10,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651480053] [2022-02-20 18:50:10,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:10,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:10,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {34086#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {34086#true} is VALID [2022-02-20 18:50:10,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {34086#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {34086#true} is VALID [2022-02-20 18:50:10,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {34086#true} assume 0 == ~r1~0; {34086#true} is VALID [2022-02-20 18:50:10,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {34086#true} assume ~id1~0 >= 0; {34086#true} is VALID [2022-02-20 18:50:10,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {34086#true} assume 0 == ~st1~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {34088#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {34088#(<= ~st1~0 0)} assume ~id2~0 >= 0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~st2~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {34088#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {34088#(<= ~st1~0 0)} assume ~id3~0 >= 0; {34088#(<= ~st1~0 0)} is VALID [2022-02-20 18:50:10,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {34088#(<= ~st1~0 0)} assume 0 == ~st3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {34089#(<= (+ ~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; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {34089#(<= (+ ~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; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {34089#(<= (+ ~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; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {34089#(<= (+ ~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; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 != ~nomsg~0; {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume !(main_~node2__m2~0#1 > ~id2~0); {34089#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 18:50:10,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {34089#(<= (+ ~st3~0 ~st1~0) 0)} assume main_~node2__m2~0#1 == ~id2~0;~st2~0 := 1; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:10,524 INFO L290 TraceCheckUtils]: 50: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:10,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:10,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:10,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:10,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode3~0 := 0; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:10,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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~0#1; {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 18:50:10,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {34090#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {34087#false} is VALID [2022-02-20 18:50:10,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {34087#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {34087#false} is VALID [2022-02-20 18:50:10,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {34087#false} assume 0 == main_~assert__arg~0#1 % 256; {34087#false} is VALID [2022-02-20 18:50:10,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {34087#false} assume !false; {34087#false} is VALID [2022-02-20 18:50:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 18:50:10,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:10,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651480053] [2022-02-20 18:50:10,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651480053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:10,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:10,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:10,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536126645] [2022-02-20 18:50:10,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:10,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:50:10,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:10,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:10,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:10,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:10,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:10,570 INFO L87 Difference]: Start difference. First operand 1311 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:15,541 INFO L93 Difference]: Finished difference Result 3379 states and 4848 transitions. [2022-02-20 18:50:15,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:15,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:50:15,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:50:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:50:15,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 326 transitions. [2022-02-20 18:50:15,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:16,033 INFO L225 Difference]: With dead ends: 3379 [2022-02-20 18:50:16,034 INFO L226 Difference]: Without dead ends: 2733 [2022-02-20 18:50:16,035 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:16,036 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 207 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:16,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 365 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2022-02-20 18:50:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2279. [2022-02-20 18:50:19,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:19,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2733 states. Second operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:19,832 INFO L74 IsIncluded]: Start isIncluded. First operand 2733 states. Second operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:19,834 INFO L87 Difference]: Start difference. First operand 2733 states. Second operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:20,039 INFO L93 Difference]: Finished difference Result 2733 states and 3903 transitions. [2022-02-20 18:50:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3903 transitions. [2022-02-20 18:50:20,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:20,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:20,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 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 2733 states. [2022-02-20 18:50:20,049 INFO L87 Difference]: Start difference. First operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 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 2733 states. [2022-02-20 18:50:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:20,299 INFO L93 Difference]: Finished difference Result 2733 states and 3903 transitions. [2022-02-20 18:50:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 3903 transitions. [2022-02-20 18:50:20,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:20,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:20,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:20,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.4240561896400352) internal successors, (3244), 2278 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3244 transitions. [2022-02-20 18:50:20,539 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3244 transitions. Word has length 60 [2022-02-20 18:50:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:20,539 INFO L470 AbstractCegarLoop]: Abstraction has 2279 states and 3244 transitions. [2022-02-20 18:50:20,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3244 transitions. [2022-02-20 18:50:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:50:20,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:20,540 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:50:20,541 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1912167623, now seen corresponding path program 1 times [2022-02-20 18:50:20,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:20,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713660387] [2022-02-20 18:50:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:20,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {47556#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {47556#true} is VALID [2022-02-20 18:50:20,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {47556#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {47556#true} is VALID [2022-02-20 18:50:20,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {47556#true} assume 0 == ~r1~0; {47556#true} is VALID [2022-02-20 18:50:20,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {47556#true} assume ~id1~0 >= 0; {47556#true} is VALID [2022-02-20 18:50:20,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {47556#true} assume 0 == ~st1~0; {47556#true} is VALID [2022-02-20 18:50:20,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {47556#true} assume ~send1~0 == ~id1~0; {47556#true} is VALID [2022-02-20 18:50:20,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {47556#true} assume 0 == ~mode1~0 % 256; {47556#true} is VALID [2022-02-20 18:50:20,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {47556#true} assume ~id2~0 >= 0; {47556#true} is VALID [2022-02-20 18:50:20,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {47556#true} assume 0 == ~st2~0; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:20,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {47558#(<= ~st2~0 0)} assume ~send2~0 == ~id2~0; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:20,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {47558#(<= ~st2~0 0)} assume 0 == ~mode2~0 % 256; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:20,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {47558#(<= ~st2~0 0)} assume ~id3~0 >= 0; {47558#(<= ~st2~0 0)} is VALID [2022-02-20 18:50:20,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {47558#(<= ~st2~0 0)} assume 0 == ~st3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 == ~id3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id2~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id1~0 != ~id3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {47559#(<= (+ ~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; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send1~0 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {47559#(<= (+ ~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; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send2~0 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {47559#(<= (+ ~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; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~send3~0 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {47559#(<= (+ ~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; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {47559#(<= (+ ~st3~0 ~st2~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~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(~r1~0 >= 3); {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 != ~nomsg~0; {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume !(main_~node1__m1~0#1 > ~id1~0); {47559#(<= (+ ~st3~0 ~st2~0) 0)} is VALID [2022-02-20 18:50:20,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {47559#(<= (+ ~st3~0 ~st2~0) 0)} assume main_~node1__m1~0#1 == ~id1~0;~st1~0 := 1; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,618 INFO L290 TraceCheckUtils]: 46: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode1~0 := 0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode2~0 := 0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} ~mode3~0 := 0; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,622 INFO L290 TraceCheckUtils]: 55: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~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~0#1; {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} is VALID [2022-02-20 18:50:20,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {47560#(and (= (+ (- 1) ~st1~0) 0) (<= (+ ~st3~0 ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {47557#false} is VALID [2022-02-20 18:50:20,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {47557#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {47557#false} is VALID [2022-02-20 18:50:20,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {47557#false} assume 0 == main_~assert__arg~0#1 % 256; {47557#false} is VALID [2022-02-20 18:50:20,623 INFO L290 TraceCheckUtils]: 59: Hoare triple {47557#false} assume !false; {47557#false} is VALID [2022-02-20 18:50:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:50:20,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:20,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713660387] [2022-02-20 18:50:20,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713660387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:50:20,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:50:20,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:50:20,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582165317] [2022-02-20 18:50:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:50:20,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:50:20,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:20,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:20,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:20,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:50:20,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:20,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:50:20,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:50:20,665 INFO L87 Difference]: Start difference. First operand 2279 states and 3244 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:26,731 INFO L93 Difference]: Finished difference Result 3631 states and 5216 transitions. [2022-02-20 18:50:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:50:26,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-02-20 18:50:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:50:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:50:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2022-02-20 18:50:26,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 326 transitions. [2022-02-20 18:50:26,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:27,325 INFO L225 Difference]: With dead ends: 3631 [2022-02-20 18:50:27,325 INFO L226 Difference]: Without dead ends: 3181 [2022-02-20 18:50:27,326 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:27,327 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 206 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:50:27,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 338 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:50:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2022-02-20 18:50:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2727. [2022-02-20 18:50:32,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:50:32,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3181 states. Second operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call 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:32,073 INFO L74 IsIncluded]: Start isIncluded. First operand 3181 states. Second operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call 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:32,076 INFO L87 Difference]: Start difference. First operand 3181 states. Second operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call 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:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,446 INFO L93 Difference]: Finished difference Result 3181 states and 4551 transitions. [2022-02-20 18:50:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4551 transitions. [2022-02-20 18:50:32,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:32,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:32,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 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 3181 states. [2022-02-20 18:50:32,455 INFO L87 Difference]: Start difference. First operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 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 3181 states. [2022-02-20 18:50:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:50:32,776 INFO L93 Difference]: Finished difference Result 3181 states and 4551 transitions. [2022-02-20 18:50:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4551 transitions. [2022-02-20 18:50:32,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:50:32,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:50:32,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:50:32,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:50:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 1.4277329420396185) internal successors, (3892), 2726 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 3892 transitions. [2022-02-20 18:50:33,107 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 3892 transitions. Word has length 60 [2022-02-20 18:50:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:50:33,107 INFO L470 AbstractCegarLoop]: Abstraction has 2727 states and 3892 transitions. [2022-02-20 18:50:33,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:50:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 3892 transitions. [2022-02-20 18:50:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 18:50:33,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:50:33,108 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:50:33,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:50:33,108 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:50:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:50:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1791952020, now seen corresponding path program 1 times [2022-02-20 18:50:33,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:50:33,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5960469] [2022-02-20 18:50:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:50:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:33,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {62906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {62906#true} is VALID [2022-02-20 18:50:33,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {62906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {62906#true} is VALID [2022-02-20 18:50:33,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {62906#true} assume 0 == ~r1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 >= 0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 == ~id1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode1~0 % 256; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 >= 0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 == ~id2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode2~0 % 256; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id3~0 >= 0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 == ~id3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~mode3~0 % 256; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id1~0 != ~id3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 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; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send1~0 != ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 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; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send2~0 != ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~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; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~send3~0 != ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 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; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 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~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(~r1~0 >= 3); {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} is VALID [2022-02-20 18:50:33,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {62908#(and (<= ~r1~0 0) (not (<= (+ (div (+ ~r1~0 1) 256) 1) 0)))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {62909#(<= ~r1~0 1)} assume !(main_~node1__m1~0#1 != ~nomsg~0); {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {62909#(<= ~r1~0 1)} ~mode1~0 := 0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {62909#(<= ~r1~0 1)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {62909#(<= ~r1~0 1)} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {62909#(<= ~r1~0 1)} assume !(main_~node2__m2~0#1 != ~nomsg~0); {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {62909#(<= ~r1~0 1)} ~mode2~0 := 0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {62909#(<= ~r1~0 1)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {62909#(<= ~r1~0 1)} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {62909#(<= ~r1~0 1)} assume !(main_~node3__m3~0#1 != ~nomsg~0); {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {62909#(<= ~r1~0 1)} ~mode3~0 := 0; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {62909#(<= ~r1~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; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {62909#(<= ~r1~0 1)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62909#(<= ~r1~0 1)} is VALID [2022-02-20 18:50:33,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {62909#(<= ~r1~0 1)} assume ~r1~0 >= 3; {62907#false} is VALID [2022-02-20 18:50:33,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {62907#false} assume !(~r1~0 < 3); {62907#false} is VALID [2022-02-20 18:50:33,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {62907#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {62907#false} is VALID [2022-02-20 18:50:33,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {62907#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {62907#false} is VALID [2022-02-20 18:50:33,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {62907#false} assume 0 == main_~assert__arg~0#1 % 256; {62907#false} is VALID [2022-02-20 18:50:33,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {62907#false} assume !false; {62907#false} is VALID [2022-02-20 18:50:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:50:33,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:50:33,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5960469] [2022-02-20 18:50:33,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5960469] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:50:33,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254966532] [2022-02-20 18:50:33,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:50:33,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:50:33,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:50:33,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:50:33,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:50:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:33,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 18:50:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:50:33,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:50:33,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {62906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {62906#true} is VALID [2022-02-20 18:50:33,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {62906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {62906#true} is VALID [2022-02-20 18:50:33,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {62906#true} assume 0 == ~r1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {62919#(= ~r1~0 0)} assume ~id1~0 >= 0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {62919#(= ~r1~0 0)} assume ~send1~0 == ~id1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {62919#(= ~r1~0 0)} assume ~id2~0 >= 0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {62919#(= ~r1~0 0)} assume ~send2~0 == ~id2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {62919#(= ~r1~0 0)} assume ~id3~0 >= 0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {62919#(= ~r1~0 0)} assume ~send3~0 == ~id3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {62919#(= ~r1~0 0)} assume ~id1~0 != ~id2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {62919#(= ~r1~0 0)} assume ~id1~0 != ~id3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {62919#(= ~r1~0 0)} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {62919#(= ~r1~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; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {62919#(= ~r1~0 0)} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {62919#(= ~r1~0 0)} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {62919#(= ~r1~0 0)} assume ~send1~0 != ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {62919#(= ~r1~0 0)} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {62919#(= ~r1~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; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {62919#(= ~r1~0 0)} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {62919#(= ~r1~0 0)} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {62919#(= ~r1~0 0)} assume ~send2~0 != ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {62919#(= ~r1~0 0)} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {62919#(= ~r1~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; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {62919#(= ~r1~0 0)} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {62919#(= ~r1~0 0)} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {62919#(= ~r1~0 0)} assume ~send3~0 != ~nomsg~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {62919#(= ~r1~0 0)} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {62919#(= ~r1~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; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {62919#(= ~r1~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~0#1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {62919#(= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {62919#(= ~r1~0 0)} assume !(~r1~0 >= 3); {62919#(= ~r1~0 0)} is VALID [2022-02-20 18:50:33,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {62919#(= ~r1~0 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:50:33,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {63029#(and (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:50:33,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {63029#(and (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:50:33,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:50:33,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} is VALID [2022-02-20 18:50:33,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {63025#(and (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (= ~r1~0 0))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node1__m1~0#1 != ~nomsg~0); {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~mode1~0 := 0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~mode2~0 := 0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 18:50:33,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {63042#(and (<= ~r1~0 1) (= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~r1~0 >= 3; {62907#false} is VALID [2022-02-20 18:50:33,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {62907#false} assume !(~r1~0 < 3); {62907#false} is VALID [2022-02-20 18:50:33,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {62907#false} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {62907#false} is VALID [2022-02-20 18:50:33,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {62907#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {62907#false} is VALID [2022-02-20 18:50:33,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {62907#false} assume 0 == main_~assert__arg~0#1 % 256; {62907#false} is VALID [2022-02-20 18:50:33,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {62907#false} assume !false; {62907#false} is VALID [2022-02-20 18:50:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:33,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:50:34,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {62907#false} assume !false; {62907#false} is VALID [2022-02-20 18:50:34,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {62907#false} assume 0 == main_~assert__arg~0#1 % 256; {62907#false} is VALID [2022-02-20 18:50:34,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {62907#false} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {62907#false} is VALID [2022-02-20 18:50:34,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} assume !(1 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~0#1 := 0; {62907#false} is VALID [2022-02-20 18:50:34,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} assume !(~r1~0 < 3); {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} is VALID [2022-02-20 18:50:34,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume ~r1~0 >= 3; {63106#(= (+ ~st3~0 ~st2~0 ~st1~0) 1)} is VALID [2022-02-20 18:50:34,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~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; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} ~mode3~0 := 0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(main_~node3__m3~0#1 != ~nomsg~0); {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,456 INFO L290 TraceCheckUtils]: 50: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(0 == ~mode3~0 % 256);main_~node3__m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,457 INFO L290 TraceCheckUtils]: 48: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} ~mode2~0 := 0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(main_~node2__m2~0#1 != ~nomsg~0); {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(0 == ~mode2~0 % 256);main_~node2__m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} ~mode1~0 := 0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} assume !(main_~node1__m1~0#1 != ~nomsg~0); {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == ~mode1~0 % 256);~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);main_~node1__m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {63113#(or (not (<= 3 ~r1~0)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1))} is VALID [2022-02-20 18:50:34,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume !(0 == main_~assert__arg~0#1 % 256);main_~main____CPAchecker_TMP_0~0#1 := main_~main__i2~0#1;main_~main__i2~0#1 := 1 + main_~main__i2~0#1; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} ~__return_1487~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1487~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; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} assume ~r1~0 < 3;main_~check__tmp~0#1 := 1; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {63153#(or (not (<= (mod (+ ~r1~0 1) 256) 127)) (= (+ ~st3~0 ~st2~0 ~st1~0) 1) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !(~r1~0 >= 3); {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~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; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~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; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~p3_new~0 == ~nomsg~0;main_~node3____CPAchecker_TMP_0~0#1 := ~send3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 != ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode3~0 % 256);havoc main_~node3____CPAchecker_TMP_0~0#1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} havoc main_~node3__m3~0#1;main_~node3__m3~0#1 := ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~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; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~p2_new~0 == ~nomsg~0;main_~node2____CPAchecker_TMP_0~0#1 := ~send2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 != ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode2~0 % 256);havoc main_~node2____CPAchecker_TMP_0~0#1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} havoc main_~node2__m2~0#1;main_~node2__m2~0#1 := ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} ~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; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~p1_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~send1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send1~0 != ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume !!(0 == ~mode1~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume main_~main__i2~0#1 < 6;havoc main_~node1__m1~0#1;main_~node1__m1~0#1 := ~nomsg~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} 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; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 != ~id3~0;main_~init__tmp~0#1 := 1;~__return_1411~0 := main_~init__tmp~0#1;main_~main__i2~0#1 := ~__return_1411~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 != ~id2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode3~0 % 256; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send3~0 == ~id3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st3~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id3~0 >= 0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode2~0 % 256; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send2~0 == ~id2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st2~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id2~0 >= 0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~mode1~0 % 256; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~send1~0 == ~id1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume 0 == ~st1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} assume ~id1~0 >= 0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {62906#true} assume 0 == ~r1~0; {63169#(or (< 127 (mod (+ ~r1~0 1) 256)) (< (mod (+ ~r1~0 1) 256) 3))} is VALID [2022-02-20 18:50:34,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {62906#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;assume -128 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 127;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -128 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 127;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -128 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 127;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -128 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 127;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -128 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 127;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~init__tmp~0#1; {62906#true} is VALID [2022-02-20 18:50:34,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {62906#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(50, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1411~0 := 0;~__return_1487~0 := 0;~__return_1543~0 := 0; {62906#true} is VALID [2022-02-20 18:50:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:50:34,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254966532] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:50:34,475 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:50:34,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2022-02-20 18:50:34,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549634500] [2022-02-20 18:50:34,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:50:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 states have internal predecessors, (170), 0 states have call successors, (0), 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 61 [2022-02-20 18:50:34,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:50:34,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call 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:34,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:50:34,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:50:34,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:50:34,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:50:34,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:50:34,619 INFO L87 Difference]: Start difference. First operand 2727 states and 3892 transitions. Second operand has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)